18 citations · 54 across the 16 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Compressed Multiple Pattern Matching
Dmitry Kosolobov, Nikita Sivukhin
Given strings over the alphabet , the classical Aho--Corasick data structure allows us to find all occurrences of the strings in any text in $O(…
cs.DS2018★ 3 cited
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time
Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov +1
Given a threshold and a set of haplotype sequences, each having length , the minimum segmentation problem for founder reconstruction…