The Greedy Algorithm for the Minimum Common String Partition Problem
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 84-95
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- COMPUTING THE ASSIGNMENT OF ORTHOLOGOUS GENES VIA GENOME REARRANGEMENT2005
- Minimum Common String Partition Problem: Hardness and Approximations2004
- Edit Distance with Move Operations2002
- Block edit models for approximate string matchingTheoretical Computer Science, 1997
- The string-to-string correction problem with block movesACM Transactions on Computer Systems, 1984