"Efficient parallel construction of suffix trees for genomes larger than ..."

Matteo Comin, Montse Farreras (2013)

> Home

Details and statistics

DOI: 10.1145/2488551.2488579

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/pvm/CominF13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pvm/CominF13
Matteo Comin, Montse Farreras:
Efficient parallel construction of suffix trees for genomes larger than main memory. EuroMPI 2013: 211-216

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.