Approximate Matching in Weighted Sequences

DOI10.1007/11780441_33zbMath1196.68340OpenAlexW2165259681MaRDI QIDQ5307520

Costas S. Iliopoulos, Oren Kapah, Ely Porat, Amihood Amir

Publication date: 14 September 2007

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780441_33

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (9)

Polynomial-time approximation algorithms for weighted LCS problem ⋮ Linear-Time Computation of Prefix Table for Weighted Strings ⋮ A multiobjective optimization algorithm for the weighted LCS ⋮ On-Line Pattern Matching on Uncertain Sequences and Applications ⋮ On-line weighted pattern matching ⋮ Linear-time computation of prefix table for weighted strings {\&} applications ⋮ Polynomial-Time Approximation Algorithms for Weighted LCS Problem ⋮ Weighted LCS ⋮ Streaming \(k\)-mismatch with error correcting and applications

This page was built for publication: Approximate Matching in Weighted Sequences