Bounds for parametric sequence comparison

We consider the problem of computing a global alignment between two or more sequences subject to varying mismatch and indel penalties. We prove a tight 3(n/2π) 2/3+O(n 1/3 log n) bound on the worst-case number of distinct optimum alignments for two sequences of length n as the parameters are varied....

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 118; číslo 3; s. 181 - 198
Hlavní autori:	Fernández-Baca, David, Seppäläinen, Timo, Slutzki, Giora
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Lausanne Elsevier B.V 15.05.2002 Amsterdam Elsevier New York, NY
Predmet:	Computational biology Exact sciences and technology Experimental analysis of algorithms Mathematics Multiple alignment Parametric analysis Sciences and techniques of general use Sequence alignment Parametric analysis Experimental analysis of algorithms Multiple alignment Sequence alignment Computational biology
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!