De Bruijn Graph assembly - Department of Computer Science

www.cs.jhu.edu

Real-world assembly methods Both handle unresolvable repeats by essentially leaving them out Fragments are contigs (short for contiguous) Unresolvable repeats break the assembly into fragments OLC: Overlap-Layout-Consensus assembly DBG: De Bruijn graph assembly a_long_long_long_time a_long_long_time a_longlong_time Assemble substrings with ...

  Assembly, Graph, De bruijn graph assembly, Bruijn