Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Heaviest path problem"'
Autor:
Epain, Victor
Publikováno v:
Bio-informatique [q-bio.QM]. 2020
Hristo Djidjev : collaborateur d'équipe associée HipcoGen; National audience; DNA molecular in silico analysis requires sequencing it in fragments called reads, and then assembling them. Today’s, long reads sequencing technologies offer the possi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3062669e75d3d78d866993abbbf94d98
https://inria.hal.science/hal-03119772
https://inria.hal.science/hal-03119772
In silico studying a genome requires two steps: sequencing it with cloning and cutting the genome in several reads, and then, assembling the reads. It is well known that the number of sequencing errors is proportional to the reads' size. However, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::39d3d49623a932dc83e485d7e3f530df
https://hal.science/hal-03007132
https://hal.science/hal-03007132
Autor:
Epain, Victor
Publikováno v:
Operations Research [cs.RO]. 2019
Hristo Djidjev : collaborateur d'équipe associée HipcoGen; International audience; In silico studying a genome requires two steps: sequencing it with cloning and cutting the genome in several reads, and then, assembling the reads. It is well known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::00e49d21fab0d396ccaa6e1488e96ef6
https://hal.inria.fr/hal-02413832v3/document
https://hal.inria.fr/hal-02413832v3/document