Algorithms for computing evolutionary similarity measures with length independent gap penalties

DOI10.1007/BF02459503MaRDI QIDQ800252zbMATH OpenOpenAlexFDO

Authors Michael L. Fredman

Publication date 1984

Published in Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02459503

zbMATH Keywords

algorithmsevolutionary similarity measureslength independent gap penaltiesthree sequence comparisons

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Dynamic programming (90C39) Algorithms in computer science (68W99) Physiological, cellular and medical topics (92Cxx)

Recommendations

• Sequence comparison with concave weighting functions
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Computing similarity of run-length encoded strings with affine gap penalty
• Optimal sequence alignment allowing for long gaps
• Locally optimal subalignments using nonlinear similarity functions

Cites work

• On the Theory and Computation of Evolutionary Distances
• Some biological sequence metrics
• The theory and computation of evolutionary distances: Pattern recognition

Cited in

(6)

• A multiple sequence comparison method
• Sequence comparison with concave weighting functions
• A survey of multiple sequence comparison methods
• A distance measure based on binary character data and its application to phylogeny reconstruction
• Consistency of optimal sequence alignments
• Optimal sequence alignment allowing for long gaps

This page was built for publication: Algorithms for computing evolutionary similarity measures with length independent gap penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800252)