Pages that link to "Item:Q1872715"
From MaRDI portal
The following pages link to The longest common subsequence problem for sequences with nested arc annotations. (Q1872715):
Displaying 5 items.
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes (Q627175) (← links)
- Approximation of RNA multiple structural alignment (Q655441) (← links)
- A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs (Q845829) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
