A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Khan, Z., Bloom, J. S., Kruglyak, L., & Singh, M. Bioinform., 25(13):1609-1616, 2009.
A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. [link]Link  A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. [link]Paper  bibtex   
@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
}

Downloads: 0