We describe a new unifying framework to express comparison of arc-annotated sequences, which we call alignment of arc-annotated sequences. We first prove that this framework encompasses main existing models, which allows us to deduce complexity results for several cases from the literature. We also show that this framework gives rise to new relevant problems that have not been studied yet. We provide a thorough analysis of these novel cases by proposing two polynomial time algorithms and an NP-completeness proof. This leads to an almost exhaustive study of alignment of arc-annotated sequences. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Blin, G., & Touzet, H. (2006). How to compare arc-annotated sequences: The alignment hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4209 LNCS, pp. 291–303). Springer Verlag. https://doi.org/10.1007/11880561_24
Mendeley helps you to discover research relevant for your work.