Using Minimum Path Cover to Boost Dynamic Programming on DAGs : Co-linear Chaining Extended

Show full item record



Permalink

http://hdl.handle.net/10138/307569

Citation

Kuosmanen , A , Paavilainen , T , Gagie , T , Chikhi , R , Tomescu , A & Mäkinen , V 2018 , Using Minimum Path Cover to Boost Dynamic Programming on DAGs : Co-linear Chaining Extended . in B J Raphael (ed.) , Research in Computational Molecular Biology : 22nd Annual International Conference, RECOMB 2018, Paris, France, April 21-24, 2018, Proceedings . Lecture Notes in Bioinformatics , vol. 10812 , Springer International Publishing AG , Cham , pp. 105-121 , Annual International Conference on Research in Computational Molecular Biology , Paris , France , 21/04/2018 . https://doi.org/10.1007/978-3-319-89929-9_7

Title: Using Minimum Path Cover to Boost Dynamic Programming on DAGs : Co-linear Chaining Extended
Author: Kuosmanen, Anna; Paavilainen, Topi; Gagie, Travis; Chikhi, Rayan; Tomescu, Alexandru; Mäkinen, Veli
Editor: Raphael, Benjamin J.
Contributor: University of Helsinki, Genome-scale Algorithmics research group / Veli Mäkinen
University of Helsinki, Department of Computer Science
University of Helsinki, Department of Computer Science
University of Helsinki, Genome-scale Algorithmics research group / Veli Mäkinen
Publisher: Springer International Publishing AG
Date: 2018-04
Language: eng
Number of pages: 17
Belongs to series: Research in Computational Molecular Biology 22nd Annual International Conference, RECOMB 2018, Paris, France, April 21-24, 2018, Proceedings
Belongs to series: Lecture Notes in Bioinformatics
ISBN: 978-3-319-89928-2
978-3-319-89929-9
URI: http://hdl.handle.net/10138/307569
Subject: 113 Computer and information sciences
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
1705.08754.pdf 988.9Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record