scientific article
From MaRDI portal
Publication:3315039
zbMath0532.68088MaRDI QIDQ3315039
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)
Related Items
Optimal sequence alignment using affine gap costs ⋮ Using Hirschberg's algorithm to generate random alignments of strings ⋮ Efficient matching of nonrectangular shapes. ⋮ Data structures and algorithms for approximate string matching ⋮ Fast string matching with k differences ⋮ Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance ⋮ Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment ⋮ String matching with weighted errors ⋮ Speeding up the detection of tandem repeats over the edit distance ⋮ Optimal sequence alignment allowing for long gaps ⋮ A survey of multiple sequence comparison methods ⋮ From Winner-Takes-All to Winners-Share-All: Exploiting the Information Capacity in Temporal Codes ⋮ Lazy dynamic-programming can be eager ⋮ General methods of sequence comparison
This page was built for publication:
