Algo Suffix Trees

Build a suffix tree for O(m) pattern search, longest repeated substring, and longest common substring (LCS). Use when finding all motif occurrences in DNA/text, detecting tandem repeats, or comparing two sequences' shared region.

pavel-kravchenko Updated

File contents

pavel-kravchenko/bioinformatics commit be92c80237

Frequently asked questions

npx get-skill add pavel-kravchenko/algo-suffix-trees