Search research articles
Contact Us
Filters
Showing results (1-10 of 34) with videos related to
Page
of 4
Sort By:
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
October 18, 2016
Safe and Complete Contig Assembly Through Omnitigs
Alexandru I Tomescu, Paul Medvedev
Genome Research
|
May 30, 2023
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
Andrea Cracco, Alexandru I Tomescu
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
July 12, 2018
Safely Filling Gaps with Partial Solutions Common to All Solutions
Leena Salmela, Alexandru I Tomescu
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
February 1, 2022
Flow Decomposition With Subpath Constraints
Lucia Williams, Alexandru I Tomescu, Brendan Mumey
BMC Bioinformatics
|
September 26, 2014
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly
Romeo Rizzi, Alexandru I Tomescu, Veli Mäkinen
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
September 13, 2024
Accurate Flow Decomposition via Robust Integer Linear Programming
Fernando H C Dias, Alexandru I Tomescu
Algorithms for Molecular Biology : AMB
|
February 16, 2018
A safe and complete algorithm for metagenomic assembly
Nidia Obscura Acosta, Veli Mäkinen, Alexandru I Tomescu
BMC Bioinformatics
|
June 6, 2013
A novel min-cost flow method for estimating transcript expression with RNA-Seq
Alexandru I Tomescu, Anna Kuosmanen, Romeo Rizzi, et al.
Lipics : Leibniz International Proceedings in Informatics
|
April 29, 2025
Applying the Safe-And-Complete Framework to Practical Genome Assembly
Sebastian Schmidt, Santeri Toivonen, Paul Medvedev, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
March 10, 2016
Gap Filling as Exact Path Length Problem
Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, et al.
Page
of 4
Search research articles
Search
Showing results (1-10 of 34) with videos related to
Sort By:
Page
of 4
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
October 18, 2016
Safe and Complete Contig Assembly Through Omnitigs
Alexandru I Tomescu, Paul Medvedev
Genome Research
|
May 30, 2023
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
Andrea Cracco, Alexandru I Tomescu
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
July 12, 2018
Safely Filling Gaps with Partial Solutions Common to All Solutions
Leena Salmela, Alexandru I Tomescu
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
February 1, 2022
Flow Decomposition With Subpath Constraints
Lucia Williams, Alexandru I Tomescu, Brendan Mumey
BMC Bioinformatics
|
September 26, 2014
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly
Romeo Rizzi, Alexandru I Tomescu, Veli Mäkinen
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
September 13, 2024
Accurate Flow Decomposition via Robust Integer Linear Programming
Fernando H C Dias, Alexandru I Tomescu
Algorithms for Molecular Biology : AMB
|
February 16, 2018
A safe and complete algorithm for metagenomic assembly
Nidia Obscura Acosta, Veli Mäkinen, Alexandru I Tomescu
BMC Bioinformatics
|
June 6, 2013
A novel min-cost flow method for estimating transcript expression with RNA-Seq
Alexandru I Tomescu, Anna Kuosmanen, Romeo Rizzi, et al.
Lipics : Leibniz International Proceedings in Informatics
|
April 29, 2025
Applying the Safe-And-Complete Framework to Practical Genome Assembly
Sebastian Schmidt, Santeri Toivonen, Paul Medvedev, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
March 10, 2016
Gap Filling as Exact Path Length Problem
Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, et al.
Page
of 4