Nalaganje...
AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS
Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However, finding a shortest double stranded DNA string (SDDNA) containing all the k-long words in t...
Shranjeno v:
| Main Authors: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
2010
|
| Teme: | |
| Online dostop: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4215799/ https://ncbi.nlm.nih.gov/pubmed/25364472 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|