Bioinformatics Vol. 16 no. 10 2000
Pages 948-949
© 2000 Oxford University Press
Applications Note |
A space-efficient algorithm for aligning large genomic sequences
1 MIPSMax-Planck-Institut
für Biochemic, Am Klopferspitz 18a,
82152 Martinsried, Germany
2 Aventis Pharma Limited, Rainham Road
South, Essex RM10 7XS, UK
Received on March 23, 2000
; revised on June 5, 2000
; accepted on June 5, 2000
Summary: 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.
Availability: The program is available at the Bielefeld Bioinformatics Server (BiBiServ) at http://bibiserv.techfak.uni-bielefeld.de/dialign/
Contact: morgenstern{at}mips.biochem.mpg.de
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
T. Sauer, E. Shelest, and E. Wingender Evaluating phylogenetic footprinting for human-rodent comparisons Bioinformatics, February 15, 2006; 22(4): 430 - 437. [Abstract] [Full Text] [PDF] |
||||
![]() |
A. C.E. Darling, B. Mau, F. R. Blattner, and N. T. Perna Mauve: Multiple Alignment of Conserved Genomic Sequence With Rearrangements Genome Res., July 1, 2004; 14(7): 1394 - 1403. [Abstract] [Full Text] [PDF] |
||||
![]() |
C. Mathe, M.-F. Sagot, T. Schiex, and P. Rouze Current methods of gene prediction, their strengths and weaknesses Nucleic Acids Res., October 1, 2002; 30(19): 4103 - 4117. [Abstract] [Full Text] [PDF] |
||||
![]() |
C. M. Bergman and M. Kreitman Analysis of Conserved Noncoding DNA in Drosophila Reveals Similar Constraints in Intergenic and Intronic Sequences Genome Res., August 1, 2001; 11(8): 1335 - 1345. [Abstract] [Full Text] [PDF] |
||||


