Pages that link to "Item:Q1099955"
From MaRDI portal
The following pages link to An \(O(ND)\) difference algorithm and its variations (Q1099955):
Displaying 41 items.
- Longest common extensions in trees (Q294947) (← links)
- Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications (Q439982) (← links)
- An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- A space efficient algorithm for finding the best nonoverlapping alignment score (Q673113) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959) (← links)
- A sublinear algorithm for approximate keyword searching (Q1336965) (← links)
- Classes of cost functions for string edit distance (Q1355732) (← links)
- Simple and fast linear space computation of longest common subsequences (Q1583368) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- Longest common extension (Q1678103) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- Relational program reasoning using compiler IR (Q1703014) (← links)
- Tandem cyclic alignment (Q1764893) (← links)
- The set-set LCS problem (Q1825675) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Fast approximate matching of words against a dictionary (Q1895867) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- LightCore: Lightweight Collaborative Editing Cloud Services for Sensitive Data (Q2794503) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Fast Algorithms for Local Similarity Queries in Two Sequences (Q2949727) (← links)
- (Q3143773) (← links)
- (Q5090981) (← links)
- (Q5111792) (← links)
- (Q5111874) (← links)
- (Q5140776) (← links)