DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Substring
Substring
Tries and String Matching
Algorithm for Character Recognition Based on the Trie Structure
Efficient Top-K Algorithms for Approximate Substring Matching
Substring Alignment Using Suffix Trees
A Heuristic Algorithm for the N-LCS Problem1
Sliding Suffix Tree
The Stringdist Package for Approximate String Matching by Mark P.J
Minimal Suffix and Rotation of a Substring in Optimal Time∗
Longest Common Substring Made Fully Dynamic
Approximate Substring Matching Over Uncertain Strings Tingjian Ge, Zheng Li University of Kentucky
[email protected]
,
[email protected]
Efficient Algorithms for Substring Near Neighbor Problem
Lecture 5: Suffix Trees
Suffix Trees
12.3 Suffix Trees and Arrays 377
Suffix Trees
A Guided Tour to Approximate String Matching 1 Introduction
An Efficient Trie-Based Method for Approximate
Sub-Linear Algorithms for Shortest Unique Substring and Maximal Unique Matches by Sanjeewa Bandara Senanayaka a Thesis Submitted
Top View
Approximate String Matching with Dynamic Programming and Suffix Trees Leng Hui Keng University of North Florida
Suffix Tries & Trees
Or Levenshtein Distance) Between Two Strings Is the Number of Insertions, Deletions, and Substitutions Needed to Transform One String Into the Other [19]