Efficient Seeds Computation Revisited

Christou, Michalis; Crochemore, Maxime; Iliopoulos, Costas; Kubica, Marcin; Pissis, Solon; Radoszewski, Jakub; Rytter, Wojciech; Szreder, Bartosz; Waleń, Tomasz

doi:10.1007/978-3-642-21458-5_30

by Christou, Michalis, Crochemore, Maxime, Iliopoulos, Costas, Kubica, Marcin, Pissis, Solon, Radoszewski, Jakub, Rytter, Wojciech, Szreder, Bartosz and Waleń, Tomasz

Reference:

M. Christou, M. Crochemore, C. Iliopoulos, M. Kubica, S. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń, "Efficient Seeds Computation Revisited", in Combinatorial Pattern Matching, R. Giancarlo, G. Manzini, Eds., Springer Berlin / Heidelberg, 2011, pp. 350-363.

Bibtex Entry:

@incollection {springerlink:10.1007/978-3-642-21458-5_30,
   author = {Christou, Michalis and Crochemore, Maxime and Iliopoulos, Costas and Kubica, Marcin and Pissis, Solon and Radoszewski, Jakub and Rytter, Wojciech and Szreder, Bartosz and Waleń, Tomasz},
   title = {Efficient Seeds Computation Revisited},
   booktitle = {Combinatorial Pattern Matching},
   series = {Lecture Notes in Computer Science},
   editor = {Giancarlo, Raffaele and Manzini, Giovanni},
   publisher = {Springer Berlin / Heidelberg},
   isbn = {978-3-642-21457-8},
   keyword = {Computer Science},
   pages = {350-363},
   volume = {6661},
   doi = {10.1007/978-3-642-21458-5_30},
   year = {2011}
}