Edit Distance with Duplications and Contractions Revisited
From MaRDI portal
Publication:3011874
DOI10.1007/978-3-642-21458-5_37zbMath1339.68336OpenAlexW2103234522MaRDI QIDQ3011874
Shay Zakov, Tamar Pinhas, Dekel Tsur, Michal Ziv-Ukelson
Publication date: 29 June 2011
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_37
Related Items
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Hardness of RNA folding problem with four symbols
Cites Work
- General context-free recognition in less than cubic time
- Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
- An improved algorithm for generalized comparison of minisatellites
- More algorithms for all-pairs shortest paths in weighted graphs
- Unnamed Item
- Unnamed Item