A Polynomial Time Solution for Permutation Scaffold Filling (Q2958369): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_60 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2540990550 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fixed-parameter algorithms for scaffold filling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Genomic Scaffold Filling Revisited. / rank | |||
Normal rank | |||
Latest revision as of 08:32, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial Time Solution for Permutation Scaffold Filling |
scientific article |
Statements
A Polynomial Time Solution for Permutation Scaffold Filling (English)
0 references
1 February 2017
0 references
