Approximate string matching is commonly used to align genetic sequences (DNA
or RNA) to determine their shared characteristics. In contrast with the standard
dynamic programming methods which use local edit distance models, the Walking
Tree heuristic method was created to handle non-local changes, e.g., translocations,
inversions, and duplications, altogether and...
Approximate string matching is commonly used to align genetic sequences (DNA or RNA) to determine their shared
characteristics. Most genetic string matching methods are based on the edit-distance model, which does not provide
alignments for inversions and translocations. Recently, a heuristic called the Walking Tree Method [2, 3] has been...
The meaning of biological sequences is a central problem
of modern biology. Although string matching is well understood
in the edit-distance model, biological strings
with transpositions and inversions violate this model's
assumptions. To align biologically reasonable strings, we
proposed the Walking Tree Method [4,5,6,7,8], an
approximate string alignment method that...