8 citations · 8 across the 2 of their papers we have counts for
2 papers
q-bio.GN2026
Supregraph: Enabling Information-Optimal Assembly Graph Representation of a Read Set
Anton Bankevich
The first step in any genome assembly algorithm entails the conversion from the domain of strings and overlaps to the language of graphs and paths, typically using one of the two c…
math.CO2011★ 8 cited
Bounds of a number of leaves of spanning trees
Anton Bankevich, Dmitri Karpov
We prove that every connected graph with vertices of degree not 2 has a spanning tree with at least leaves. Let be a be a connected graph of girth w…