Pages that link to "Item:Q3550838"
From MaRDI portal
The following pages link to Sparse LCS Common Substring Alignment (Q3550838):
Displaying 10 items.
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- Sparse normalized local alignment (Q818666) (← links)
- Non-overlapping common substrings allowing mutations (Q942988) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- A space efficient algorithm for the longest common subsequence in \(k\)-length substrings (Q2357383) (← links)
- An all-substrings common subsequence algorithm (Q2482100) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
- On the common substring alignment problem (Q2775894) (← links)
- (Q3581624) (← links)
- Combinatorial Pattern Matching (Q5315342) (← links)