Pages that link to "Item:Q963999"
From MaRDI portal
The following pages link to Efficient algorithms for the block edit problems (Q963999):
Displaying 5 items.
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- Edit distance with block deletions (Q1736478) (← links)
- Finding the gapped longest common subsequence by incremental suffix maximum queries (Q2252523) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- Fast computation of a string duplication history under no-breakpoint-reuse (Q2955628) (← links)
