- Computing Maximum Number of Runs in StringsKazuhiko Kusano; Kazuyuki Narisawa; Ayumi ShinoharaString Processing and Information Retrieval, Springer Berlin Heidelberg, 318-329, 2012.
- Efficient Data Structures for the Factor Periodicity ProblemTomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz WaleńString Processing and Information Retrieval, Springer Berlin Heidelberg, 284-294, 2012.
- Faster Algorithm for Computing the Edit Distance between SLP-Compressed StringsPaweł GawrychowskiString Processing and Information Retrieval, Springer Berlin Heidelberg, 229-236, 2012.
书籍章节
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time
13阅读
