search

isf-bot / eagle-i

0 stars 0 forks source link

de Bruijn graph-based method #136

Closed isf-bot closed 9 years ago

isf-bot commented 9 years ago

From fcold...@eagle-i.org on October 31, 2012 12:16:47

** Use the form below to request a new term ** ** Scroll down to see a term request example ** Please indicate the label for the proposed term: de Bruijn graph-based method Please provide a textual definition (with source): Algorithmic idea to find a shortest circular 'superstring' that contains all possible 'substrings' of length k (k-mers) over a given alphabet. http://www.nature.com/nbt/journal/v29/n11/full/nbt.2023.html Please add an example of usage for proposed term: To be used in the 'Algorithm Used' field, for example to describe methods of de novo assembly of sequence reads into contigs or a genome. Please provide any additional optional information below. (e.g. desired asserted SuperClass in ERO hierarchy or Reference Branch) [ ] Instrument [ ] Biological process [ ] Disease [ ] Human studies [ ] Instrument [ ] Organism [ ] Reagent [X] Software [ ] Technique [ ] Organization Additional info:

Original issue: http://code.google.com/p/eagle-i/issues/detail?id=148

isf-bot commented 9 years ago

From sc...@eagle-i.org on November 05, 2012 14:45:00

Status: Accepted

isf-bot commented 9 years ago

From sc...@eagle-i.org on November 05, 2012 14:45:15

Owner: sc...@eagle-i.org

isf-bot commented 9 years ago

From sc...@eagle-i.org on January 17, 2013 10:21:51

Added to SWO term request.

Status: Started
Labels: algorithm

isf-bot commented 9 years ago

From sc...@eagle-i.org on January 21, 2013 16:53:14

Will be available in release in early February.

Status: Fixed