The next-generation sequencing era requires reliable, fast and efficient approaches for the accurate annotation of the ever-increasing number of biological sequences and their variations. Transfer of annotation upon similarity search is a standard approach. The procedure of all-against-all protein comparison is a preliminary step of different available methods that annotate sequences based on information already present in databases. Given the actual volume of sequences, methods are necessary to pre-process data to reduce the time of sequence comparison.
Profiti, G., Fariselli, P., Casadio, R. (2015). AlignBucket: a tool to speed up 'all-against-all' protein sequence alignments optimizing length constraints. BIOINFORMATICS, 31(23), 3841-3843 [10.1093/bioinformatics/btv451].
AlignBucket: a tool to speed up 'all-against-all' protein sequence alignments optimizing length constraints
PROFITI, GIUSEPPE;FARISELLI, PIERO;CASADIO, RITA
2015
Abstract
The next-generation sequencing era requires reliable, fast and efficient approaches for the accurate annotation of the ever-increasing number of biological sequences and their variations. Transfer of annotation upon similarity search is a standard approach. The procedure of all-against-all protein comparison is a preliminary step of different available methods that annotate sequences based on information already present in databases. Given the actual volume of sequences, methods are necessary to pre-process data to reduce the time of sequence comparison.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
