%0 Conference Paper %1 conf/cpm/Cobbs95 %A Cobbs, Archie L. %B CPM %D 1995 %E Galil, Zvi %E Ukkonen, Esko %I Springer %K dblp %P 41-54 %T Fast Approximate Matching using Suffix Trees. %U http://dblp.uni-trier.de/db/conf/cpm/cpm95.html#Cobbs95 %V 937 %@ 3-540-60044-2

@inproceedings{conf/cpm/Cobbs95, added-at = {2019-08-08T00:00:00.000+0200}, author = {Cobbs, Archie L.}, biburl = {https://www.bibsonomy.org/bibtex/2eadcdf7e78e4ddff3739870a42eb3d88/dblp}, booktitle = {CPM}, crossref = {conf/cpm/95}, editor = {Galil, Zvi and Ukkonen, Esko}, ee = {https://doi.org/10.1007/3-540-60044-2_33}, interhash = {875b09d896ae1bdc544afc588119f7ae}, intrahash = {eadcdf7e78e4ddff3739870a42eb3d88}, isbn = {3-540-60044-2}, keywords = {dblp}, pages = {41-54}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-08-30T11:39:09.000+0200}, title = {Fast Approximate Matching using Suffix Trees.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm95.html#Cobbs95}, volume = 937, year = 1995 }