A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays

Zia Khan, Joshua S. Bloom, Leonid Kruglyak, Mona Singh. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics, 25(13):1609-1616, 2009. [doi]

@article{KhanBKS09,
  title = {A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays},
  author = {Zia Khan and Joshua S. Bloom and Leonid Kruglyak and Mona Singh},
  year = {2009},
  doi = {10.1093/bioinformatics/btp275},
  url = {http://dx.doi.org/10.1093/bioinformatics/btp275},
  researchr = {https://researchr.org/publication/KhanBKS09},
  cites = {0},
  citedby = {0},
  journal = {Bioinformatics},
  volume = {25},
  number = {13},
  pages = {1609-1616},
}