On the Theory and Computation of Evolutionary Distances
From MaRDI portal
Publication:4042877
DOI10.1137/0126070zbMath0291.92013OpenAlexW1977618577WikidataQ56446192 ScholiaQ56446192MaRDI QIDQ4042877
Publication date: 1974
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0126070
Genetics and epigenetics (92D10) General biology and biomathematics (92B05) Algorithms in computer science (68W99)
Related Items (37)
Optimal sequence alignment using affine gap costs ⋮ A nonlinear measure of subalignment similarity and its significance levels ⋮ Locally optimal subalignments using nonlinear similarity functions ⋮ Probabilistic ancestral sequences and multiple alignments ⋮ Constrained many-to-one string editing with memory ⋮ Novel evolutionary models and applications to sequence alignment problems ⋮ Dynamic programming algorithms for picture comparison ⋮ A metric normalization of tree edit distance ⋮ Quantifying Statistical Interdependence by Message Passing on Graphs—Part I: One-Dimensional Point Processes ⋮ A distance measure based on binary character data and its application to phylogeny reconstruction ⋮ The undecidability of the unrestricted modified edit distance ⋮ Volume formula and growth rates of the balls of strings under the edit distances ⋮ Matrices inducing generalized metric on sequences ⋮ Extending alignments with \(k\)-mismatches and \(\ell\)-gaps ⋮ Minimum message length encoding and the comparison of macromolecules ⋮ Optimal sequence alignment allowing for long gaps ⋮ Consistency of optimal sequence alignments ⋮ Detecting life signatures with RNA sequence similarity measures ⋮ Comparison of biosequences ⋮ A survey of multiple sequence comparison methods ⋮ Amino acid sequences and DP matching: A new method for alignment ⋮ Nested wreath groups and their applications to phylogeny in biology and Cayley trees in chemistry and physics ⋮ Improvement of Pairwise Alignment by an Information Measure ⋮ A bit-string longest-common-subsequence algorithm ⋮ Identifying periodic occurrences of a template with applications to protein structure ⋮ Use of information theory to study genome sequences ⋮ Some biological sequence metrics ⋮ A Fast ℒp Spike Alignment Metric ⋮ RNA secondary structure: a complete mathematical analysis ⋮ Global and local sequence alignment with a bounded number of gaps ⋮ General methods of sequence comparison ⋮ Line geometries for sequence comparisons ⋮ Algorithms for computing evolutionary similarity measures with length independent gap penalties ⋮ The prediction of a protein and nucleic acid structure: Problems and prospects ⋮ String editing under a combination of constraints ⋮ Pattern recognition in genetic sequences by mismatch density ⋮ Application of max-plus algebra to biological sequence comparisons
This page was built for publication: On the Theory and Computation of Evolutionary Distances
