Pages that link to "Item:Q645279"
From MaRDI portal
The following pages link to A fast algorithm for the partial digest problem (Q645279):
Displaying 8 items.
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm (Q1191625) (← links)
- A lower bound on the number of solutions to the probed partial digest problem (Q1261855) (← links)
- A partial digest approach to restriction site mapping (Q1319891) (← links)
- The restriction mapping problem revisited. (Q1872722) (← 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)