Imagen de Portada

Comparative genomics with succinct colored de Bruijn graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ramos, Lucas P., Louza, Felipe A., Telles, Guilherme P.
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

In-Place BWT and Lyndon Array Construction in Constant Space
por: Louza, Felipe A., et al.
Publicado: (2025)

Almost succinct representation of maximal palindromes
por: Mieno, Takuya, et al.
Publicado: (2025)

When is String Reconstruction using de Bruijn Graphs Hard?
por: Bals, Ben, et al.
Publicado: (2025)

Implementation Of Dynamic De Bruijn Graphs Via Learned Index
por: Nigrelli, Riccardo
Publicado: (2024)

Differentially private graph coloring
por: Xie, Michael, et al.
Publicado: (2026)

Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
por: Kowalik, Lukasz
Publicado: (2024)

Kernelization for list $H$-coloring for graphs with small vertex cover
por: Piecyk, Marta, et al.
Publicado: (2025)

A customizable inexact subgraph matching algorithm for attributed graphs
por: Benko, Tatyana, et al.
Publicado: (2025)

The Canadian Traveller Problem on outerplanar graphs
por: Beaudou, Laurent, et al.
Publicado: (2024)

Better coloring of 3-colorable graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2024)

Coloring tournaments with few colors: Algorithms and complexity
por: Klingelhoefer, Felix, et al.
Publicado: (2023)

Finding $b$-colorings Using Feedback Edges
por: Balabán, Jakub
Publicado: (2025)

Dynamic O(arboricity) coloring in polylogarithmic worst-case time
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Improved linearly ordered colorings of hypergraphs via SDP rounding
por: Louis, Anand, et al.
Publicado: (2024)

Erdős-Gyárfás conjecture on graphs without long induced paths
por: Hegde, Anand Shripad, et al.
Publicado: (2024)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
por: Lachish, Oded, et al.
Publicado: (2026)

Approximating maximum properly colored forests via degree bounded independent sets
por: Bai, Yuhang, et al.
Publicado: (2025)

Comparative Performance of the AVL Tree and Three Variants of the Red-Black Tree
por: Brown, Russell A.
Publicado: (2024)

Private graph colouring with limited defectiveness
por: Christiansen, Aleksander B. G., et al.
Publicado: (2024)

Practical algorithms for Hierarchical overlap graphs
por: Talera, Saumya, et al.
Publicado: (2024)

The trace reconstruction problem for spider graphs
por: Sun, Alec, et al.
Publicado: (2022)

Spanning tree congestion of proper interval graphs
por: Otachi, Yota
Publicado: (2026)

Approximating optimization problems in graphs with locational uncertainty
por: Bougeret, Marin, et al.
Publicado: (2022)

Improved girth approximation in weighted undirected graphs
por: Kadria, Avi, et al.
Publicado: (2025)

Fair densest subgraph across multiple graphs
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

On $k$-connectivity oracles in $k$-connected graphs
por: Nutov, Zeev
Publicado: (2026)

Upper bounds on the theta function of random graphs
por: Feige, Uriel, et al.
Publicado: (2025)

On recognizing graphs representing Persistent Perfect Phylogenies
por: Bonizzoni, Paola, et al.
Publicado: (2025)

Strassen's algorithm via orbit flip graphs
por: Ikenmeyer, Christian, et al.
Publicado: (2025)

Testing $C_k$-freeness in bounded-arboricity graphs
por: Eden, Talya, et al.
Publicado: (2024)

Faster algorithms for packing forests in graphs and related problems
por: Arkhipov, Pavel, et al.
Publicado: (2024)

Quasilinear-time eccentricities computation, and more, on median graphs
por: Bergé, Pierre, et al.
Publicado: (2024)

A QPTAS for Facility Location on Unit Disk graphs
por: Friggstad, Zachary, et al.
Publicado: (2024)

An FPRAS for two terminal reliability in directed acyclic graphs
por: Feng, Weiming, et al.
Publicado: (2023)

The Leafed Induced Subtree in chordal and bounded treewidth graphs
por: Baste, Julien
Publicado: (2023)

Simple and efficient four-cycle counting on sparse graphs
por: Burkhardt, Paul, et al.
Publicado: (2023)

Exact recovery of planted cliques in semi-random graphs
por: Khanna, Yash
Publicado: (2020)

Dynamic framework for edge-connectivity maintenance of simple graphs
por: Wrobel, Blazej
Publicado: (2026)

Revisiting Directed Disjoint Paths on tournaments (and relatives)
por: Gomes, Guilherme C. M., et al.
Publicado: (2025)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
por: Bougeret, Marin, et al.
Publicado: (2026)