galantelab / sideRETRO
90%
master: 97%

LAST BUILD BRANCH: HEAD
DEFAULT BRANCH: master
Repo Added
Files 27
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

LAST BUILD ON BRANCH assembly
branch: assembly
CHANGE BRANCH
x

373

push

travis-ci

thiago-miller 
ADD: graph_enumerate.c: Find bubble motifs

Find bubble motifs in unipath graphs

4711 of 5220 relevant lines covered (90.25%)

1761.87 hits per line

Relevant lines Covered
5220 RELEVANT LINES 4711 COVERED LINES
1761.87 HITS PER LINE
Source Files on assembly

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
373 assembly ADD: graph_enumerate.c: Find bubble motifs Find bubble motifs in unipath graphs push thiago-miller travis-ci pending completion  
371 assembly CHANGE: graph_unipath.c: Alias Graph to Unipath push thiago-miller travis-ci pending completion  
370 assembly UPDATE: graph_unipath.c: Add start and end nodes push thiago-miller travis-ci pending completion  
369 assembly ADD: assembly/sucateiro.c (printers): Dump graph Print the k-mers, edges depths and dot file push thiago-miller travis-ci pending completion  
368 assembly ADD: assembly/sucateiro.c: Assembler for testing push thiago-miller travis-ci pending completion  
367 assembly ADD: graph_unipath.c: Build an unipath graph Path contraction is a techinque, which may help out to enumerate some motifs, as tips, bubbles and super bubbles push thiago-miller travis-ci pending completion  
366 assembly CHANGE: graph.c: Parent list in adjacency In order to quickly find all parents to a given vertex and also find the vertex in out degrees, it keeps a parent list in each adjacency push thiago-miller travis-ci pending completion  
365 assembly CHANGE: graph.c, debrujin.c (graph_ins_edge) Keep an exclusive pointer to vertex edges, that way, it is possible to manipulate different edge attributes for the same vertex push thiago-miller travis-ci pending completion  
364 assembly ADD: debrujin.c (debrujin_shortest_path): BFS Solve unweighted shortest path with 'Breadth First Search'. Floyd Warshall algorithm takes so much time and space push thiago-miller travis-ci pending completion  
363 assembly ADD: hungarian.c: Solve Minimum Assignment Problem Solving the minimum mssignment problem using the hungarian method. Code adapted from 'libhungarian' by Cyrill Stachniss, 2004. Make the cost matrix work with double push thiago-miller travis-ci pending completion  
See All Builds (277)