A divide-and-conquer algorithm for large-scale de novo transcriptome assembly through combining small assemblies from existing algorithms.
Sing-Hoi SzeJonathan J. ParrottAaron M. TaronePublished in: ICCABS (2016)
Keyphrases
- learning algorithm
- times faster
- computational cost
- computational complexity
- computationally efficient
- recently developed
- worst case
- synthetic and real datasets
- computational efficiency
- significant improvement
- motif finding
- single pass
- theoretical analysis
- synthetic and real world datasets
- related algorithms
- benchmark problems
- empirical analyses
- detection algorithm
- k means
- cost function
- np hard
- filtering algorithm
- space complexity
- optimal solution
- optimization problems
- memory requirements
- hybrid algorithm
- dynamic programming
- synthetic datasets
- image processing algorithms
- matching algorithm
- classification algorithm
- biological sequences
- computationally demanding
- preprocessing
- maximum flow
- objective function
- theoretical guarantees
- exhaustive search
- particle swarm optimization
- optimization algorithm
- microarray