scientific article; zbMATH DE number 1516705

Publication date: 11 October 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

edit distance Levenshtein distance Macromolecules sequence distance String edits Time warps

Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Collected or selected works; reprintings or translations of classics (01A75) Natural language processing (68T50)

Related Items (56)

Enumerative aspects of secondary structures ⋮ Using Hirschberg's algorithm to generate random alignments of strings ⋮ DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM ⋮ Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ Maximal success durations for a semi-Markov process ⋮ Computing the edit distance of a regular language ⋮ Algorithms for approximate graph matching ⋮ On the variance of the optimal alignments score for binary random words and an asymmetric scoring function ⋮ Combinatorial algorithms for DNA sequence assembly ⋮ Calculating distances for dissimilar strings: the shortest path formulation revisited ⋮ Fast string matching with k differences ⋮ Posets of shuffles ⋮ Dynamic programming algorithms for picture comparison ⋮ Matching patterns in strings subject to multi-linear transformations ⋮ In memoriam Joseph B. Kruskal 1928--2010 ⋮ Longest common subsequence problem for unoriented and cyclic strings ⋮ On posets of \(m\)-ary words ⋮ Parametric multiple sequence alignment and phylogeny construction ⋮ Comparison methods for branching and axillary flowering sequences ⋮ On the Varshamov-Tenengolts construction on binary strings ⋮ Block edit models for approximate string matching ⋮ A central limit theorem for the length of the longest common subsequences in random words ⋮ The Clustering Structure of the COVID-19 Outbreak in Global Scale ⋮ The multiple sequence sets: Problem and heuristic algorithms ⋮ Extending alignments with \(k\)-mismatches and \(\ell\)-gaps ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers ⋮ Exact mean computation in dynamic time warping spaces ⋮ Large deviations-based upper bounds on the expected relative length of longest common subsequences ⋮ Optimal canonization of all substrings of a string ⋮ Every binary pattern of length six is avoidable on the two-letter alphabet ⋮ Alignment of trees -- an alternative to tree edit ⋮ Quick Greedy Computation for Minimum Common String Partitions ⋮ Restricted Common Superstring and Restricted Common Supersequence ⋮ A large neighborhood search heuristic for the longest common subsequence problem ⋮ Partially local multi-way alignments ⋮ An algorithm for matching run-length coded strings ⋮ A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION ⋮ A bit-string longest-common-subsequence algorithm ⋮ Logarithmic behavior of some combinatorial sequences ⋮ Algorithms for finding a most similar subforest ⋮ Some results on mean square error for factor score prediction ⋮ Identifying consensus of trees through alignment ⋮ Quick greedy computation for minimum common string partition ⋮ Unnamed Item ⋮ Finding longest increasing and common subsequences in streaming data ⋮ MULTISCALE COMPARISON AND CLUSTERING OF THREE-DIMENSIONAL TRAJECTORIES BASED ON CURVATURE MAXIMA ⋮ A Method to Reduce Errors of String Recognition Based on Combination of Several Recognition Results with Per-Character Alternatives ⋮ Fast prefix matching of bounded strings ⋮ A model of fixed activation time scheduling ⋮ Reconstructing a history of recombinations from a set of sequences ⋮ On implementing recognizable transductions ⋮ A computationally efficient approximation to the nearest neighbor interchange metric ⋮ Edit distance of run-length encoded strings. ⋮ String editing under a combination of constraints ⋮ The utilization of fuzzy sets in the recognition of imperfect strings ⋮ A fast and practical bit-vector algorithm for the longest common subsequence problem

This page was built for publication: