1. A. Amir, O. Lipsky, E. Porat, J. Umanski, Approximate matching in the L1 metric, in: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM’05), 2005, pp. 91–103.
2. A. Amir, E. Porat, M. Lewenstein, Approximate subset matching with don’t cares, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’01), 2001, pp. 305–306.
3. Optimal off-line detection of repetitions in a string;Apostolico;Theoretical Computer Science,1983
4. Y.J. Pinzon Ardila, M. Christodoulakis, C.S. Iliopoulos, M. Mohamed, Efficient (δ,γ)-pattern-matching with don’t cares, in: Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA’05), Ballarat, Australia, 2005, pp. 27–38.
5. M. Bender, M. Farach-Colton, The LCA problem revisited, in: Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN’00), 2000, pp. 88–94.