"A practical algorithm for finding maximal exact matches in large sequence ..."

Zia Khan et al. (2009)

> Home

Details and statistics

DOI: 10.1093/BIOINFORMATICS/BTP275

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/bioinformatics/KhanBKS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bioinformatics/KhanBKS09
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. Bioinform. 25(13): 1609-1616 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.