Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm.
Valérie BerthéSébastien LabbéPublished in: CoRR (2014)
Keyphrases
- worst case
- computational complexity
- computational cost
- times faster
- space complexity
- preprocessing
- learning algorithm
- improved algorithm
- clustering method
- np hard
- objective function
- detection algorithm
- optimal solution
- optimization algorithm
- theoretical analysis
- k means
- matching algorithm
- significant improvement
- computationally efficient
- particle swarm optimization
- linear programming
- evolutionary algorithm
- experimental evaluation
- classification algorithm
- image segmentation
- decision trees
- neural network
- multiple sequence alignment
- sequence matching