742 citations · 807 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-Linear Chaining Extended
Anna Kuosmanen, Topi Paavilainen, Travis Gagie +3
Aligning sequencing reads on graph representations of genomes is an important ingredient of pan-genomics. Such approaches typically find a set of local anchors that indicate plausi…
cs.DS2017
Fast and scalable minimal perfect hashing for massive key sets
Antoine Limasset, Guillaume Rizk, Rayan Chikhi +1
Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical l…