A Polynomial Time Solvable Formulation of Multiple Sequence Alignment
Annual international conference; 9th, Research in computational molecular biology: 9th annual international conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005 : proceedings ; 2005 ; Cambridge, MA
2005-01-01
13 pages
Conference proceedings. Includes bibliographical references and index.
Aufsatz (Konferenz)
Englisch
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
A Restricted Reachability Problem of Petri Nets Solvable in Pseudo-Polynomial Time
British Library Online Contents | 1993
|Linear Sequence-to-Sequence Alignment
British Library Conference Proceedings | 2004
|Linear sequence-to-sequence alignment
IEEE | 2004
|