%0 Journal Article
%T Kermit: linkage map guided long read assembly
%A Pasi Rastas
%A Riku Walve
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2019
%R 10.1186/s13015-019-0143-x
%X Unitigs can be efficiently found by first looking for a vertex with either zero or more than one incoming edge and exactly one outgoing edge. Following the outgoing edges until we find a vertex with more than one incoming edge or zero or more than one outgoing edge constructs a path spelling a unitig
%K Genome assembly
%K Linkage maps
%K Coloured overlap graph
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6425630/