Pages that link to "Item:Q1099955"
From MaRDI portal
The following pages link to An \(O(ND)\) difference algorithm and its variations (Q1099955):
Displaying 15 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)
- (Q5090981) (← links)
- (Q5111792) (← links)
- (Q5111874) (← links)
- (Q5140776) (← links)
