%0 Conference Paper %1 conf/cpm/Risvik98 %A Risvik, Knut Magne %B CPM %D 1998 %E Farach-Colton, Martin %I Springer %K dblp %P 65-79 %T Approximate Word Sequence Matching over Sparse Suffix Trees. %U http://dblp.uni-trier.de/db/conf/cpm/cpm98.html#Risvik98 %V 1448 %@ 3-540-64739-2

@inproceedings{conf/cpm/Risvik98, added-at = {2017-05-23T00:00:00.000+0200}, author = {Risvik, Knut Magne}, biburl = {https://www.bibsonomy.org/bibtex/237feabbbb4d53b9f7cc5db7138639da9/dblp}, booktitle = {CPM}, crossref = {conf/cpm/1998}, editor = {Farach-Colton, Martin}, ee = {https://doi.org/10.1007/BFb0030781}, interhash = {7648ebce3eb09442475c316c0d357aaf}, intrahash = {37feabbbb4d53b9f7cc5db7138639da9}, isbn = {3-540-64739-2}, keywords = {dblp}, pages = {65-79}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:48:09.000+0200}, title = {Approximate Word Sequence Matching over Sparse Suffix Trees.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm98.html#Risvik98}, volume = 1448, year = 1998 }