A space-efficient algorithm for aligning large genomic sequences.
In the segment-by-segment approach to sequence alignment, pairwise and multiple alignments are generated by comparing gap-free segments of the sequences under study. This method is particularly efficient in detecting local homologies, and it has been used to identify functional regions in large genomic sequences. Herein, an algorithm is outlined that calculates optimal pairwise segment-by-segment alignments in essentially linear space. AVAILABILTIY: The program is available at the Bielefeld Bioinformatics Server (BiBiServ) at http://bibiserv.techfak. uni-bielefeld.de/dialign/
Morgenstern
B
B
MIPS-Max-Planck-Institut für Biochemic, Am Klopferspitz 18a, 82152 Martinsried, Germany. morgenstern@mips.biochem.mpg.de
D000465:Algorithms; D016415:Sequence Alignment / Q000379:methods*; D012984:Software