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

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 118; no. 3; pp. 181 - 198
Main Authors:	Fernández-Baca, David, Seppäläinen, Timo, Slutzki, Giora
Format:	Journal Article
Language:	English
Published:	Lausanne Elsevier B.V 15.05.2002 Amsterdam Elsevier New York, NY
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!