Title
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
Authors
[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee
Year of publication
2007
Published in
Article type
scientific article
Publication language
english
Keywords
EN
- graph theory
- computational complexity
- computational biology
- DNA sequencing
Pages (from - to)
154 - 162
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS