Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays

Crochemore, Maxime; Iliopoulos, Costas S.; Kubica, Marcin; Rytter, Wojciech; Walen, Tomasz

by Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen

Reference:

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen), In SOFSEM 2010: Theory and Practice of Computer Science (Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe, eds.), Springer Berlin / Heidelberg, volume 5901, 2010.

Bibtex Entry:

@INPROCEEDINGS{SOFSEM2010,
	author = "Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Wojciech Rytter and Tomasz Walen",
	title = "Efficient Algorithms for Two Extensions of {LPF} Table: The Power of Suffix Arrays",
	booktitle = "SOFSEM 2010: Theory and Practice of Computer Science",
	series = "Lecture Notes in Computer Science",
	editor = "Jan van Leeuwen and Anca Muscholl and David Peleg and Jaroslav Pokorn{\'y} and Bernhard Rumpe",
	publisher = "Springer Berlin / Heidelberg",
	pages = "296--307",
	volume = "5901",
	year = "2010"
}