Pages that link to "Item:Q925058"
From MaRDI portal
The following pages link to Regular expression constrained sequence alignment (Q925058):
Displaying 9 items.
- Algorithms for path-constrained sequence alignment (Q396718) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Practical regular expression constrained sequence alignment (Q2310751) (← links)
- Efficient algorithms for regular expression constrained sequence alignment (Q2379980) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
- Regular Language Constrained Sequence Alignment Revisited (Q3000526) (← links)
- Computing longest common square subsequences (Q5140779) (← links)
- Combinatorial Pattern Matching (Q5713554) (← links)