M. Andrade, Caroline Louis-Jeune, C. Perez-Iratxeta
{"title":"FASTA Herder:一个修剪蛋白质序列集的web应用程序","authors":"M. Andrade, Caroline Louis-Jeune, C. Perez-Iratxeta","doi":"10.14293/S2199-1006.1.SOR-LIFE.A67837.V2","DOIUrl":null,"url":null,"abstract":"Abstract\nThe ever increasing number of sequences in protein databases usually turns out large numbers of homologs in sequence similarity searches. While information from homology can be very useful for functional prediction based on amino acid conservation, many of these homologs usually have high levels of identity among themselves, which hinders multiple sequence alignment computation and, especially, visualization. More generally, high redundancy reduces the usability of a protein set in machine learning applications and biases statistical analyses. We developed an algorithm to identify redundant sequence homologs that can be culled producing a streamlined FASTA file. As a difference from other automatic approaches that only aggregate sequences with high identity, our method clusters near-full length homologs allowing for lower sequence identity thresholds. Our method was fully tested and implemented in a web application called FASTA Herder, publicly available at http://fh.ogic.ca/.","PeriodicalId":91169,"journal":{"name":"ScienceOpen research","volume":"138 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"FASTA Herder: a web application to trim protein sequence sets\",\"authors\":\"M. Andrade, Caroline Louis-Jeune, C. Perez-Iratxeta\",\"doi\":\"10.14293/S2199-1006.1.SOR-LIFE.A67837.V2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract\\nThe ever increasing number of sequences in protein databases usually turns out large numbers of homologs in sequence similarity searches. While information from homology can be very useful for functional prediction based on amino acid conservation, many of these homologs usually have high levels of identity among themselves, which hinders multiple sequence alignment computation and, especially, visualization. More generally, high redundancy reduces the usability of a protein set in machine learning applications and biases statistical analyses. We developed an algorithm to identify redundant sequence homologs that can be culled producing a streamlined FASTA file. As a difference from other automatic approaches that only aggregate sequences with high identity, our method clusters near-full length homologs allowing for lower sequence identity thresholds. Our method was fully tested and implemented in a web application called FASTA Herder, publicly available at http://fh.ogic.ca/.\",\"PeriodicalId\":91169,\"journal\":{\"name\":\"ScienceOpen research\",\"volume\":\"138 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ScienceOpen research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14293/S2199-1006.1.SOR-LIFE.A67837.V2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ScienceOpen research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14293/S2199-1006.1.SOR-LIFE.A67837.V2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
FASTA Herder: a web application to trim protein sequence sets
Abstract
The ever increasing number of sequences in protein databases usually turns out large numbers of homologs in sequence similarity searches. While information from homology can be very useful for functional prediction based on amino acid conservation, many of these homologs usually have high levels of identity among themselves, which hinders multiple sequence alignment computation and, especially, visualization. More generally, high redundancy reduces the usability of a protein set in machine learning applications and biases statistical analyses. We developed an algorithm to identify redundant sequence homologs that can be culled producing a streamlined FASTA file. As a difference from other automatic approaches that only aggregate sequences with high identity, our method clusters near-full length homologs allowing for lower sequence identity thresholds. Our method was fully tested and implemented in a web application called FASTA Herder, publicly available at http://fh.ogic.ca/.