1992
DOI: 10.1093/bioinformatics/8.5.481
|View full text |Cite
|
Sign up to set email alerts
|

Aligning two sequences within a specified diagonal band

Abstract: We describe an algorithm for aligning two sequences within a diagonal band that requires only O(NW) computation time and O(N) space, where N is the length of the shorter of the two sequences and W is the width of the band. The basic algorithm can be used to calculate either local or global alignment scores. Local alignments are produced by finding the beginning and end of a best local alignment in the band, and then applying the global alignment algorithm between those points. This algorithm has been incorpora… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
111
0
2

Year Published

1993
1993
2017
2017

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 122 publications
(114 citation statements)
references
References 23 publications
1
111
0
2
Order By: Relevance
“…Functional annotation of assembled transcripts was assigned using WU-BLAST (Chao et al, 1992) by searching the Arabidopsis thaliana proteome (Lamesch et al, 2012), UniRef100 (Suzek et al, 2007), and peptides deposited in GenBank for A. belladonna using an E-value cutoff #1e-10. Pfam domains (Finn et al, 2010) were identified using HMMPfam from the HMMER package (v 3) (Krogh et al, 1994;Eddy, 1998Eddy, , 2009 with an E-value cutoff of 1e-10.…”
Section: Functional Annotationmentioning
confidence: 99%
“…Functional annotation of assembled transcripts was assigned using WU-BLAST (Chao et al, 1992) by searching the Arabidopsis thaliana proteome (Lamesch et al, 2012), UniRef100 (Suzek et al, 2007), and peptides deposited in GenBank for A. belladonna using an E-value cutoff #1e-10. Pfam domains (Finn et al, 2010) were identified using HMMPfam from the HMMER package (v 3) (Krogh et al, 1994;Eddy, 1998Eddy, , 2009 with an E-value cutoff of 1e-10.…”
Section: Functional Annotationmentioning
confidence: 99%
“…The platform was modified to calculate the performance of the algorithm for each query sequence from within the parallel program. A derivative of version 1.6 of the FASTA program (Chao et al, 1992) was used; the implementation of the Smith-Waterman algorithm was described in Pearson and Miller (1992). The platform was extended to include a global similarity score calculated by a modification of the Needleman-Wunsch algorithm (Myers & Miller, 1988).…”
Section: Similarity Searchingmentioning
confidence: 99%
“…Thus, discordant results for microarray elements having the same annotation (i.e., XChipID) are best resolved by a rigorous BLAST comparison of element sequences with each other and with the target gene sequence. Although a BLAST comparison of each microarray element sequence with the entire sequence database is technically daunting, a simple comparison of such a sequence with a target sequence is quite simple using the LALIGN program (part of the FASTA package; ftp://ftp.virginia.edu/ pub/fasta/) (Chao et al 1992) and could be automated as a quality control check for the annotation of the entire microarray.…”
Section: Discussionmentioning
confidence: 99%