1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Fast and Simple Jumbled Indexing for Binary RLE Strings
Luís Cunha, Simone Dantas, Travis Gagie +3
Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size woul…
cs.DS2016★ 1 cited
The SCJ small parsimony problem for weighted gene adjacencies (Extended version)
Nina Luhmann, Manuel Lafond, Annelyse Thévenin +3
Reconstructing ancestral gene orders in a given phylogeny is a classical problem in comparative genomics. Most existing methods compare conserved features in extant genomes in the…