An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
From MaRDI portal
Publication:3657444
DOI10.1137/1025045zbMath0512.68048OpenAlexW2057568625MaRDI QIDQ3657444
Publication date: 1983
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1025045
speech processingrecursive algorithmssequence comparisonbird songgas chromatographymacromolecular biologyhandwriting analysisdistance between sequencesgeological stratatext collation
Pattern recognition, speech recognition (68T10) Genetics and epigenetics (92D10) General biology and biomathematics (92B05) Discrete mathematics in relation to computer science (68R99)
Related Items (41)
Constrained tree editing ⋮ Predicting Successful and Unsuccessful Transitions from School to Work by Using Sequence Methods ⋮ A genetic algorithm on multiple sequences alignment problems in biology ⋮ Optimized homology searches of the gene and protein sequence data banks ⋮ An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search ⋮ Parametric optimization of sequence alignment ⋮ Sublinear approximate string matching and biological applications ⋮ Computing the similarity of two sequences with nested arc annotations ⋮ A survey of temporal data mining ⋮ Significance levels for biological sequence comparison using non-linear similarity functions ⋮ Classes of cost functions for string edit distance ⋮ Comparing resemblance measures ⋮ Constrained many-to-one string editing with memory ⋮ Similarity and dissimilarity in posets ⋮ Two applications of the divide \(\&\) conquer principle in the molecular sciences ⋮ Algorithms for the optimal identification of segment neighborhoods ⋮ Improving classifier performance through repeated sampling. ⋮ A time warping approach to multiple sequence alignment ⋮ Solving longest common subsequence problems via a transformation to the maximum clique problem ⋮ Approximation algorithms for tree alignment with a given phylogeny ⋮ A measure of DNA sequence similarity by Fourier transform with applications on hierarchical clustering ⋮ Unnamed Item ⋮ 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 ⋮ Sequence matching with binary codes ⋮ Distribution of the number of matches between nucleotide sequences ⋮ An \(A^\ast\) search algorithm for the constrained longest common subsequence problem ⋮ Large deviations-based upper bounds on the expected relative length of longest common subsequences ⋮ An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition ⋮ The complexity of querying indefinite data about linearly ordered domains ⋮ Efficient methods for multiple sequence alignment with guaranteed error bounds ⋮ Learning local transductions is hard ⋮ A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance ⋮ Kernels for sequentially ordered data ⋮ Hierarchical multidimensional scaling for the comparison of musical performance styles ⋮ Properties of Levenshtein metrics on sequences ⋮ A computationally efficient approximation to the nearest neighbor interchange metric ⋮ General methods of sequence comparison ⋮ A note on the evaluation of similarity (homology) of short sequences with long sequences ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
This page was built for publication: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
