Latest

• dipwmsearch: a Python package for searching di-PWM motifs
• A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs
• Efficient Construction of Hierarchical Overlap Graphs
• Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring
• Hierarchical Overlap Graph
• AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees
• Linking indexing data structures to de Bruijn graphs: Construction and update
• Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding
• Relationship between superstring and compression measures: New insights on the greedy conjecture
• Practical lower and upper bounds for the Shortest Linear Superstring
• Superstrings with multiplicities
• The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings
• Read mapping on de Bruijn graphs
• A linear time algorithm for Shortest Cyclic Cover of Strings
• Shortest DNA Cyclic Cover in Compressed Space
• Colib’read on galaxy: a tools suite dedicated to biological information extraction from raw NGS reads
• Superstring Graph: A New Approach for Genome Assembly
• Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree
• Reverse engineering of compact suffix trees and links: A novel algorithm
• Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings
• From Indexing Data Structures to de Bruijn Graphs