An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
From MaRDI portal
Cited in
(45)- A computationally efficient approximation to the nearest neighbor interchange metric
- Optimized homology searches of the gene and protein sequence data banks
- Significance levels for biological sequence comparison using non-linear similarity functions
- Algorithms for the optimal identification of segment neighborhoods
- Efficient methods for multiple sequence alignment with guaranteed error bounds
- Constrained tree editing
- Parametric optimization of sequence alignment
- Sublinear approximate string matching and biological applications
- Classes of cost functions for string edit distance
- Constrained many-to-one string editing with memory
- Similarity and dissimilarity in posets
- Two applications of the divide \(\&\) conquer principle in the molecular sciences
- Improving classifier performance through repeated sampling.
- Learning local transductions is hard
- Computing the similarity of two sequences with nested arc annotations
- Comparing resemblance measures
- Approximation algorithms for tree alignment with a given phylogeny
- Hierarchical multidimensional scaling for the comparison of musical performance styles
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
- An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition
- A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- A survey of temporal data mining
- A time warping approach to multiple sequence alignment
- A measure of DNA sequence similarity by Fourier transform with applications on hierarchical clustering
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- Kernels for sequentially ordered data
- Predicting Successful and Unsuccessful Transitions from School to Work by Using Sequence Methods
- A genetic algorithm on multiple sequences alignment problems in biology
- Large deviations-based upper bounds on the expected relative length of longest common subsequences
- A comparison of rhythmic dissimilarity measures
- When variable-length codes meet the field of error detection
- Finite Approximations and Similarity of Languages
- A sum-over-paths extension of edit distances accounting for all sequence alignments
- The complexity of querying indefinite data about linearly ordered domains
- A^*PA2: up to 19 faster exact global alignment
- Edit distance of finite state transducers
- Sequential pattern detection: similarities and differences across various fields
- Matching probability between two aligned Markov dependent nucleic acid sequences while allowing d mutations. In honour of Joseph Glaz for his distinguished career and profound contributions to the field of applied probability and statistics
- Properties of Levenshtein metrics on sequences
- General methods of sequence comparison
- A note on the evaluation of similarity (homology) of short sequences with long sequences
- Sequence matching with binary codes
- Distribution of the number of matches between nucleotide sequences
This page was built for publication: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657444)
