- Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear TimeGolnaz Badkobeh; Maxime Crochemore; Chalita ToopsuwanString Processing and Information Retrieval, Springer Berlin Heidelberg, 61-72, 2012.
- Faster Algorithm for Computing the Edit Distance between SLP-Compressed StringsPaweł GawrychowskiString Processing and Information Retrieval, Springer Berlin Heidelberg, 229-236, 2012.
- An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) WordsMichelangelo, Cianciulli; Rocco, Zaccagnino; Rosalba, ZizzaTheory and Practice of Natural Computing, Springer Berlin Heidelberg, 121-132, 2012.
书籍章节
Computing Maximum Number of Runs in Strings
4阅读
