DNA sequence assembly involving an acyclic graph model
[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] pracownik | [ D ] doktorant
2013
artykuł naukowy
angielski
- DNA sequence assembly
- acyclic graph model
- GPU programming
EN The problem of DNA sequence assembly is well known for its high complexity. Experimental errors of di erent kinds present in data and huge sizes of the problem instances make this problem very hard to solve. In order to deal with such data, advanced efficient heuristics must be constructed. Here, we propose a new approach to the sequence assembly problem, modeled as the problem of searching for paths in an acyclic digraph. Since the graph representing an assembly instance is not acyclic in general, it is heuristically transformed into the acyclic form. This approach reduces the time of computations significantly and allows to maintain high quality of produced solutions.
25 - 34
CC BY-NC-ND (uznanie autorstwa - użycie niekomercyjne - bez utworów zależnych)
publiczny
15