@article{journals/bioinformatics/KhanBKS09,
  added-at = {2020-03-02T00:00:00.000+0100},
  author = {Khan, Zia and Bloom, Joshua S. and Kruglyak, Leonid and Singh, Mona},
  biburl = {https://www.bibsonomy.org/bibtex/27bd3555eab9a365af82288fefaed4bdb/dblp},
  ee = {https://www.wikidata.org/entity/Q37319694},
  interhash = {ec325560d2d713545f81e6ed5ca4327b},
  intrahash = {7bd3555eab9a365af82288fefaed4bdb},
  journal = {Bioinform.},
  keywords = {dblp},
  number = 13,
  pages = {1609-1616},
  timestamp = {2020-03-03T12:09:04.000+0100},
  title = {A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays.},
  url = {http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics25.html#KhanBKS09},
  volume = 25,
  year = 2009
}

{"_id":"ub8JY2sCFCGKdH96Q","bibbaseid":"khan-bloom-kruglyak-singh-apracticalalgorithmforfindingmaximalexactmatchesinlargesequencedatasetsusingsparsesuffixarrays-2009","author_short":["Khan, Z.","Bloom, J. S.","Kruglyak, L.","Singh, M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-03-02T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Khan"],"firstnames":["Zia"],"suffixes":[]},{"propositions":[],"lastnames":["Bloom"],"firstnames":["Joshua","S."],"suffixes":[]},{"propositions":[],"lastnames":["Kruglyak"],"firstnames":["Leonid"],"suffixes":[]},{"propositions":[],"lastnames":["Singh"],"firstnames":["Mona"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/27bd3555eab9a365af82288fefaed4bdb/dblp","ee":"https://www.wikidata.org/entity/Q37319694","interhash":"ec325560d2d713545f81e6ed5ca4327b","intrahash":"7bd3555eab9a365af82288fefaed4bdb","journal":"Bioinform.","keywords":"dblp","number":"13","pages":"1609-1616","timestamp":"2020-03-03T12:09:04.000+0100","title":"A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays.","url":"http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics25.html#KhanBKS09","volume":"25","year":"2009","bibtex":"@article{journals/bioinformatics/KhanBKS09,\n added-at = {2020-03-02T00:00:00.000+0100},\n author = {Khan, Zia and Bloom, Joshua S. and Kruglyak, Leonid and Singh, Mona},\n biburl = {https://www.bibsonomy.org/bibtex/27bd3555eab9a365af82288fefaed4bdb/dblp},\n ee = {https://www.wikidata.org/entity/Q37319694},\n interhash = {ec325560d2d713545f81e6ed5ca4327b},\n intrahash = {7bd3555eab9a365af82288fefaed4bdb},\n journal = {Bioinform.},\n keywords = {dblp},\n number = 13,\n pages = {1609-1616},\n timestamp = {2020-03-03T12:09:04.000+0100},\n title = {A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays.},\n url = {http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics25.html#KhanBKS09},\n volume = 25,\n year = 2009\n}\n\n","author_short":["Khan, Z.","Bloom, J. S.","Kruglyak, L.","Singh, M."],"key":"journals/bioinformatics/KhanBKS09","id":"journals/bioinformatics/KhanBKS09","bibbaseid":"khan-bloom-kruglyak-singh-apracticalalgorithmforfindingmaximalexactmatchesinlargesequencedatasetsusingsparsesuffixarrays-2009","role":"author","urls":{"Link":"https://www.wikidata.org/entity/Q37319694","Paper":"http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics25.html#KhanBKS09"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/mona?items=1000","dataSources":["jYHT7wnpj5jtkdx3t"],"keywords":["dblp"],"search_terms":["practical","algorithm","finding","maximal","exact","matches","large","sequence","datasets","using","sparse","suffix","arrays","khan","bloom","kruglyak","singh"],"title":"A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays.","year":2009}