StarCode 9.0.0

0 views

Skip to first unread message

Message has been deleted

Kym Cavrak

unread,

Jul 11, 2024, 4:02:21 PM7/11/24

to caupendoorgbi

Results: Here, we address this challenge and describe an exact algorithm to determine which pairs of sequences lie within a given Levenshtein distance. For error correction or redundancy reduction purposes, matched pairs are then merged into clusters of similar sequences. The efficiency of starcode is attributable to the poucet search, a novel implementation of the Needleman-Wunsch algorithm performed on the nodes of a trie. On the task of matching random barcodes, starcode outperforms sequence clustering algorithms in both speed and precision.