Pages that link to "Item:Q876717"
From MaRDI portal
The following pages link to The longest common subsequence problem for arc-annotated sequences (Q876717):
Displaying 15 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes (Q627175) (← links)
- A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs (Q845829) (← links)
- Improved algorithms for largest cardinality 2-interval pattern problem (Q996829) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- (Q2723948) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q2908085) (← links)
- Parameterized Complexity of the Arc-Preserving Subsequence Problem (Q3057629) (← links)
- (Q5090981) (← links)
- (Q5111874) (← links)