Fast computation of a string duplication history under no-breakpoint-reuse

DOI10.1098/rsta.2013.0133zbMath1353.68312OpenAlexW2057825205WikidataQ37718320 ScholiaQ37718320MaRDI QIDQ2955628

Tomáš Vinař, Gad M. Landau, Broňa Brejová, Martin Kravec

Publication date: 13 January 2017

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rsta.2013.0133

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Dynamic fractional cascading
• Efficient algorithms for the block edit problems
• Block edit models for approximate string matching
• Edit distance with move operations
• The string edit distance matching problem with moves
• Linear work suffix array construction

This page was built for publication: Fast computation of a string duplication history under no-breakpoint-reuse