On the Theory and Computation of Evolutionary Distances
From MaRDI portal
(Redirected from Publication:4042877)
Cited in
(39)- The prediction of a protein and nucleic acid structure: Problems and prospects
- Pattern recognition in genetic sequences by mismatch density
- Optimal sequence alignment using affine gap costs
- A nonlinear measure of subalignment similarity and its significance levels
- Locally optimal subalignments using nonlinear similarity functions
- Dynamic programming algorithms for picture comparison
- Comparison of biosequences
- A survey of multiple sequence comparison methods
- Amino acid sequences and DP matching: A new method for alignment
- Identifying periodic occurrences of a template with applications to protein structure
- Some biological sequence metrics
- RNA secondary structure: a complete mathematical analysis
- String editing under a combination of constraints
- Constrained many-to-one string editing with memory
- The undecidability of the unrestricted modified edit distance
- Detecting life signatures with RNA sequence similarity measures
- Application of max-plus algebra to biological sequence comparisons
- A distance measure based on binary character data and its application to phylogeny reconstruction
- A bit-string longest-common-subsequence algorithm
- Global and local sequence alignment with a bounded number of gaps
- Extending alignments with k-mismatches and -gaps
- Matrices inducing generalized metric on sequences
- A Fast ℒp Spike Alignment Metric
- A metric normalization of tree edit distance
- Probabilistic ancestral sequences and multiple alignments
- Nested wreath groups and their applications to phylogeny in biology and Cayley trees in chemistry and physics
- Quantifying Statistical Interdependence by Message Passing on Graphs—Part I: One-Dimensional Point Processes
- Improvement of Pairwise Alignment by an Information Measure
- Use of information theory to study genome sequences
- Volume formula and growth rates of the balls of strings under the edit distances
- A^*PA2: up to 19 faster exact global alignment
- Bounded weighted edit distance: dynamic algorithms and matching lower bounds
- General methods of sequence comparison
- Line geometries for sequence comparisons
- Algorithms for computing evolutionary similarity measures with length independent gap penalties
- Novel evolutionary models and applications to sequence alignment problems
- Minimum message length encoding and the comparison of macromolecules
- Optimal sequence alignment allowing for long gaps
- Consistency of optimal sequence alignments
This page was built for publication: On the Theory and Computation of Evolutionary Distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4042877)
