Published October 12, 2018
| Version 1.0
Dataset
Open
Theory and a heuristic for the minimum path flow decomposition problem
Creators
- 1. Pennsylvania State University
- 2. Carnegie Mellon University
Contributors
Researchers:
- 1. Pennsylvania State University
- 2. Carnegie Mellon University
Description
This is the data used in the following paper:
Shao, Mingfu, and Carl Kingsford. "Theory and A Heuristic for the Minimum Path Flow Decomposition Problem." IEEE/ACM Transactions on Computational Biology and Bioinformatics (2017).
Files
Files
(1.4 GB)
Name | Size | Download all |
---|---|---|
md5:c68ea6c98be1e985904279e36678f1e1
|
1.4 GB | Download |
Additional details
Related works
- Is supplement to
- 10.1109/TCBB.2017.2779509 (DOI)
References
- Shao, Mingfu, and Carl Kingsford. "Theory and A Heuristic for the Minimum Path Flow Decomposition Problem." IEEE/ACM Transactions on Computational Biology and Bioinformatics (2017).