Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs
Vamsi KundetiSanguthevar RajasekaranHieu DinhPublished in: CoRR (2010)
Keyphrases
- computationally efficient
- computationally expensive
- parallel architectures
- computational cost
- data structure
- computationally intensive
- highly efficient
- decision trees
- shared memory
- efficient implementation
- computationally complex
- data mining
- parallel processors
- depth first search
- graph structure
- graph theory
- index structure
- theoretical analysis
- optimization problems
- computational complexity
- search algorithm
- learning algorithm