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 geno...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Bioinformatics Ročník 16; číslo 10; s. 948 - 949
Hlavní autor: Morgenstern, Burkhard
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Oxford University Press 01.10.2000
Oxford Publishing Limited (England)
Témata:
ISSN:1367-4803, 1460-2059, 1367-4811
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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@mips.biochem.mpg.de
Bibliografie:istex:B9B8C333975372D85D0949E5007C98D3206E31B9
ark:/67375/HXZ-3RBGM7HB-5
local:160948
PII:1460-2059
ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ObjectType-Feature-2
ISSN:1367-4803
1460-2059
1367-4811
DOI:10.1093/bioinformatics/16.10.948