Pages that link to "Item:Q1261855"
From MaRDI portal
The following pages link to A lower bound on the number of solutions to the probed partial digest problem (Q1261855):
Displaying 8 items.
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- A partial digest approach to restriction site mapping (Q1319891) (← links)
- The restriction mapping problem revisited. (Q1872722) (← links)
- DNA physical mapping and alternating Eulerian cycles in colored graphs (Q1902468) (← links)
- The number of clone orderings (Q1923582) (← links)
- On the number of ordered factorizations of natural numbers (Q1972137) (← links)
- A new dynamic programming algorithm for the simplified partial digest problem (Q2697542) (← links)
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem (Q5439390) (← links)