Pages that link to "Item:Q2482100"
From MaRDI portal
The following pages link to An all-substrings common subsequence algorithm (Q2482100):
Displaying 11 items.
- Monge properties of sequence alignment (Q418004) (← links)
- Semi-local string comparison: algorithmic techniques and applications (Q942990) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- On the common substring alignment problem (Q2775894) (← links)
- The longest common substring problem (Q2971067) (← links)
- Periodic String Comparison (Q3637113) (← links)
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)