Shortest Undirected Paths in de Bruijn Graphs

No abstract is available for this paper.

• Publication year

  2025

• Venue

  Annual Symposium on Combinatorial Pattern Matching

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.CPM.2025.12
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Connecting de Bruijn Graphs

  2024influential reference
• What do Eulerian and Hamiltonian cycles have to do with genome assembly?

  2021cited by this paper
• Matchtigs: minimum plain text representation of k-mer sets

  2021cited by this paper
• Reverse-Safe Text Indexing

  2021cited by this paper
• Beyond the BEST Theorem: Fast Assessment of Eulerian Trails

  2021cited by this paper
• Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once

  2021cited by this paper
• The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly

  2020cited by this paper
• A safe and complete algorithm for metagenomic assembly

  2018cited by this paper
• Safe and Complete Contig Assembly Through Omnitigs

  2017cited by this paper
• Assembly algorithms for next-generation sequencing data.

  2010cited by this paper
• Computability of Models for Sequence Assembly

  2007cited by this paper
• On the power of unique 2-prover 1-round games

  2002cited by this paper
• An Eulerian path approach to DNA fragment assembly

  2001cited by this paper
• Optimal Suffix Tree Construction with Large Alphabets

  1997cited by this paper
• Optimal routing in the de Bruijn networks

  1990influential reference
• A fast algorithm for Steiner trees

  1981cited by this paper
• On Finding Minimal Length Superstrings

  1980cited by this paper
• Fast Pattern Matching in Strings

  1977cited by this paper
• Linear Pattern Matching Algorithms

  1973cited by this paper
• PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

  1968cited by this paper
• Shortest connection networks and some generalizations

  1957cited by this paper

• No citing papers are available for this paper.