General methods of sequence comparison
From MaRDI portal
Recommendations
Cites work
- A molecular sequence metric and evolutionary trees
- A sequence-comparison statistic and algorithm
- Algorithms for approximate string matching
- An algorithm for the distance between two finite sequences
- An extreme value theory for sequence matching
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Asymptotic Limits for a Two-Dimensional Recursion
- Comparison of biosequences
- scientific article; zbMATH DE number 3845091 (Why is no real title available?)
- scientific article; zbMATH DE number 3675903 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Matching code sequences utilizing context free quality measures
- Matching Sequences under Deletion/Insertion Constraints
- Minimal Mutation Trees of Sequences
- Multidimensional scaling, tree-fitting, and clustering
- New approaches for computer analysis of nucleic acid sequences.
- Note on a “Square” Functional Equation
- On the Theory and Computation of Evolutionary Distances
- Pattern recognition in genetic sequences
- Sequence alignments in the neighborhood of the optimum with general application to dynamic programming
- Sequence comparison by dynamic programming
- Shortcuts, diversions, and maximal chains in partially ordered sets
- Some biological sequence metrics
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
- The Context Dependent Comparison of Biological Sequences
- The theory and computation of evolutionary distances: Pattern recognition
Cited in
(52)- Pattern recognition in several sequences: Consensus and alignment
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
- Stanislaw M. Ulam's contributions to theoretical biology
- Optimized homology searches of the gene and protein sequence data banks
- Locally optimal subalignments using nonlinear similarity functions
- Graph nodes and a definition of structural similarity
- The alignment of protein structures in three dimensions
- Algorithms for the optimal identification of segment neighborhoods
- Posets of shuffles
- Approximate matching of regular expressions
- Speeding up dynamic programming with applications to molecular biology
- A local algorithm for DNA sequence alignment with inversions
- A survey of multiple sequence comparison methods
- Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons
- A multiple sequence comparison method
- An efficient method for searching characteristic patterns of a subset in a large set of character sequences
- What can and what cannot be inferred from pairwise sequence comparisons?
- Parametric and ensemble sequence alignment algorithms
- A differential geometric treatment of protein structure comparison
- Multiple sequence comparison -- a peptide matching approach
- New method for global alignment of 2 DNA sequences by the tree data structure
- Comparison of strings belonging to the same family
- Approximate regular expression pattern matching with concave gap penalties
- On posets of \(m\)-ary words
- A bit-string longest-common-subsequence algorithm
- Comparison methods for branching and axillary flowering sequences
- Sparse long blocks and the micro-structure of the longuest common subsequences
- Letter change bias and local uniqueness in optimal sequence alignments
- The method to compare nucleotide sequences based on the minimum entropy principle
- Set-spectrum method in structure comparison and the concept of topological kinship
- The Context Dependent Comparison of Biological Sequences
- On an alternative sequence comparison statistic of Steele
- Fast Matching Method for DNA Sequences
- scientific article; zbMATH DE number 3898657 (Why is no real title available?)
- Sequence Alignments with Matched Sections
- scientific article; zbMATH DE number 13327 (Why is no real title available?)
- scientific article; zbMATH DE number 1945159 (Why is no real title available?)
- scientific article; zbMATH DE number 764528 (Why is no real title available?)
- On locally optimal alignments in genetic sequences
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Large deviations-based upper bounds on the expected relative length of longest common subsequences
- Comparison for DNA primary sequences
- Some mathematical methods in the analysis of biological sequences
- Four billion years: the story of an ancient protein family
- Approximately matching context-free languages
- Spectral distortion measures for biological sequence comparisons and database searching
- Computing orbits of the automorphism group of the subsequence poset \(B_{ m, n }\)
- Minimum message length encoding and the comparison of macromolecules
- On the number of alignments of k sequences
- Distribution of the number of matches between nucleotide sequences
- Thermodynamical approach to the longest common subsequence problem
- Sequence comparison. Theory and methods
This page was built for publication: General methods of sequence comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799527)
