%0 Conference Paper %1 conf/wob/MirandaA05 %A de Castro Miranda, Rodrigo %A Ayala-Rincón, Mauricio %B BSB %D 2005 %E Setubal, João C. %E Verjovski-Almeida, Sergio %I Springer %K %P 210-213 %T A Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays. %U http://dblp.uni-trier.de/db/conf/wob/bsb2005.html#MirandaA05 %V 3594 %@ 3-540-28008-1

@inproceedings{conf/wob/MirandaA05, added-at = {2023-12-12T17:22:23.000+0100}, author = {de Castro Miranda, Rodrigo and Ayala-Rincón, Mauricio}, biburl = {https://www.bibsonomy.org/bibtex/22c53a07f26c7211d3b3b56397abede8c/admin}, booktitle = {BSB}, crossref = {conf/wob/2005}, editor = {Setubal, João C. and Verjovski-Almeida, Sergio}, ee = {http://dx.doi.org/10.1007/11532323_25}, interhash = {02af995a2366086abf00a92e19c46287}, intrahash = {2c53a07f26c7211d3b3b56397abede8c}, isbn = {3-540-28008-1}, keywords = {}, pages = {210-213}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-12T17:22:23.000+0100}, title = {A Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays.}, url = {http://dblp.uni-trier.de/db/conf/wob/bsb2005.html#MirandaA05}, volume = 3594, year = 2005 }