Efficient parallel construction of suffix trees for genomes larger than main memory.
Matteo CominMontse FarrerasPublished in: EuroMPI (2013)
Keyphrases
- main memory
- disk resident
- data structure
- suffix tree
- index structure
- cache conscious
- database management systems
- secondary storage
- inverted file
- space requirements
- indexing structure
- secondary memory
- join algorithms
- flash memory
- memory storage
- b tree
- data sets
- external memory
- space efficient
- suffix array
- structured data
- virtual memory
- main memory databases
- multi dimensional
- training data