Published February 19, 2021
| Version 1.0.0
Software
Open
Used software and data for "Using the Longest Run Subsequence Problem within Homology-based Scaffolding"
Creators
- 1. Algorithmic Bioinformatics, Heinrich Heine University Düsseldorf, Germany
- 2. Max Planck Institute for Plant Breeding Research, Cologne, Germany; Faculty of Biology, LMU Munich, Germany
- 3. Heinrich Heine University Düsseldorf, Germany
- 4. Cluster of Excellence on Plant Sciences (CEPLAS), Heinrich Heine University Düsseldorf, Germany; Max Planck Institute for Plant Breeding Research, Cologne, Germany; Faculty of Biology, LMU Munich, Germany
- 5. Algorithmic Bioinformatics, Heinrich Heine University Düsseldorf, Germany; Cluster of Excellence on Plant Sciences (CEPLAS), Heinrich Heine University Düsseldorf, Germany
Description
Contains used code, scripts and data for the publicaion "Using the Longest Run Subsequence Problem within Homology-based Scaffolding" by Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger and Gunnar W. Klau. The synthetic experiments and the code of the algorithms is placed in the `lrs` folder. The code is identical to the version 1.0.0, which is available as a PyPI package. The setup for the biological data is explained in `readme.md` in the `chroder` folder.
Notes
Files
lrs-software-data.zip
Files
(23.8 kB)
Name | Size | Download all |
---|---|---|
md5:de167fedc2adcb5974dcdb976f008efd
|
23.8 kB | Preview Download |