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 15 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- 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)
- The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- RNA multiple structural alignment with longest common subsequences (Q2385486) (← links)
- Fast arc-annotated subsequence matching in linear space (Q2428660) (← links)
- (Q2723948) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q2908085) (← links)
- Parameterized Complexity of the Arc-Preserving Subsequence Problem (Q3057629) (← links)
- Computational Science – ICCS 2005 (Q5709406) (← links)
