A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm

DOI10.1016/j.tcs.2016.04.028zbMath1356.68303OpenAlexW2346600214MaRDI QIDQ507395

Jeong Seop Sim, Joong Chae Na, Heejin Park, Young-Ho Kim

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.028

zbMATH Keywords

parallelizationapproximate string matchingedit distanceFour-Russians' algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05) Algorithms on strings (68W32)

Related Items

Unnamed Item

Uses Software

• BWA

Cites Work

• Unnamed Item
• A faster algorithm computing string edit distances
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• Efficient string matching
• Algorithms on Strings, Trees and Sequences