A four-stage algorithm for updating a Burrows-Wheeler transform.
Mikaël SalsonThierry LecroqMartine LéonardLaurent MouchardPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- data sets
- learning algorithm
- preprocessing
- times faster
- detection algorithm
- optimization algorithm
- theoretical analysis
- experimental evaluation
- computationally efficient
- clustering method
- worst case
- neural network
- improved algorithm
- convex hull
- path planning
- computational cost
- cost function
- significant improvement
- k means
- multiresolution
- probabilistic model
- np hard
- segmentation algorithm
- ant colony optimization
- matching algorithm
- evolutionary algorithm
- optimal solution
- memory requirements
- similarity measure