The following pages link to (Q2723948):
Displaying 13 items.
- 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)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Fast detection of common sequence structure patterns in RNAs (Q2457292) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q2908085) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
