A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes.
Aïda OuangraouaValentin GuignonSylvie HamelCédric ChauvePublished in: Theor. Comput. Sci. (2011)
Keyphrases
- dynamic programming
- experimental evaluation
- detection algorithm
- improved algorithm
- preprocessing
- k means
- learning algorithm
- times faster
- matching algorithm
- optimal solution
- computational cost
- weight assignment
- long sequences
- weighting scheme
- optimization algorithm
- computationally efficient
- linear programming
- high accuracy
- segmentation algorithm
- simulated annealing
- worst case
- np hard
- arbitrary length
- cost function