Bounds for parametric sequence comparison

DOI10.1016/S0166-218X(01)00206-2zbMath1015.92015OpenAlexW2119435310WikidataQ126849119 ScholiaQ126849119MaRDI QIDQ1602688

Giora Slutzki, Timo Seppäläinen, David Fernández Baca

Publication date: 24 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00206-2

zbMATH Keywords

computational biologyparametric analysismultiple alignmentssequence alignmentsexperimental analysis of algorithms

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)

Related Items

Optimality regions and fluctuations for Bernoulli last passage models ⋮ Lower bounds for optimal alignments of binary sequences

Cites Work

• Parametric optimization of sequence alignment
• The Multiple Sequence Alignment Problem in Biology
• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item