@inproceedings{conf/cpm/AmitCL13,
  added-at = {2017-05-26T00:00:00.000+0200},
  author = {Amit, Mika and Crochemore, Maxime and Landau, Gad M.},
  biburl = {https://www.bibsonomy.org/bibtex/2a33911bfc0d7b134bb16f5ed3c10f1e7/dblp},
  booktitle = {CPM},
  crossref = {conf/cpm/2013},
  editor = {Fischer, Johannes and Sanders, Peter},
  ee = {https://doi.org/10.1007/978-3-642-38905-4_4},
  interhash = {a41c59146b909e4face1cef076488789},
  intrahash = {a33911bfc0d7b134bb16f5ed3c10f1e7},
  isbn = {978-3-642-38905-4},
  keywords = {dblp},
  pages = {13-27},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T13:48:46.000+0200},
  title = {Locating All Maximal Approximate Runs in a String.},
  url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2013.html#AmitCL13},
  volume = 7922,
  year = 2013
}

{"_id":"CQCJLnuZRoTi5MpWG","bibbaseid":"amit-crochemore-landau-locatingallmaximalapproximaterunsinastring-2013","author_short":["Amit, M.","Crochemore, M.","Landau, G. M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-26T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Amit"],"firstnames":["Mika"],"suffixes":[]},{"propositions":[],"lastnames":["Crochemore"],"firstnames":["Maxime"],"suffixes":[]},{"propositions":[],"lastnames":["Landau"],"firstnames":["Gad","M."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2a33911bfc0d7b134bb16f5ed3c10f1e7/dblp","booktitle":"CPM","crossref":"conf/cpm/2013","editor":[{"propositions":[],"lastnames":["Fischer"],"firstnames":["Johannes"],"suffixes":[]},{"propositions":[],"lastnames":["Sanders"],"firstnames":["Peter"],"suffixes":[]}],"ee":"https://doi.org/10.1007/978-3-642-38905-4_4","interhash":"a41c59146b909e4face1cef076488789","intrahash":"a33911bfc0d7b134bb16f5ed3c10f1e7","isbn":"978-3-642-38905-4","keywords":"dblp","pages":"13-27","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T13:48:46.000+0200","title":"Locating All Maximal Approximate Runs in a String.","url":"http://dblp.uni-trier.de/db/conf/cpm/cpm2013.html#AmitCL13","volume":"7922","year":"2013","bibtex":"@inproceedings{conf/cpm/AmitCL13,\n added-at = {2017-05-26T00:00:00.000+0200},\n author = {Amit, Mika and Crochemore, Maxime and Landau, Gad M.},\n biburl = {https://www.bibsonomy.org/bibtex/2a33911bfc0d7b134bb16f5ed3c10f1e7/dblp},\n booktitle = {CPM},\n crossref = {conf/cpm/2013},\n editor = {Fischer, Johannes and Sanders, Peter},\n ee = {https://doi.org/10.1007/978-3-642-38905-4_4},\n interhash = {a41c59146b909e4face1cef076488789},\n intrahash = {a33911bfc0d7b134bb16f5ed3c10f1e7},\n isbn = {978-3-642-38905-4},\n keywords = {dblp},\n pages = {13-27},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T13:48:46.000+0200},\n title = {Locating All Maximal Approximate Runs in a String.},\n url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2013.html#AmitCL13},\n volume = 7922,\n year = 2013\n}\n\n","author_short":["Amit, M.","Crochemore, M.","Landau, G. M."],"editor_short":["Fischer, J.","Sanders, P."],"key":"conf/cpm/AmitCL13","id":"conf/cpm/AmitCL13","bibbaseid":"amit-crochemore-landau-locatingallmaximalapproximaterunsinastring-2013","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-642-38905-4_4","Paper":"http://dblp.uni-trier.de/db/conf/cpm/cpm2013.html#AmitCL13"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/Landau?items=1000","dataSources":["2Mbw2PT5CoNiwZHYd"],"keywords":["dblp"],"search_terms":["locating","maximal","approximate","runs","string","amit","crochemore","landau"],"title":"Locating All Maximal Approximate Runs in a String.","year":2013}