טוען...
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...
שמור ב:
| Main Authors: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
2010
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4215799/ https://ncbi.nlm.nih.gov/pubmed/25364472 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|