Pages that link to "Item:Q1319891"

The following pages link to A partial digest approach to restriction site mapping (Q1319891):

Displaying 12 items.

• The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
• A fast algorithm for the partial digest problem (Q645279) (← links)
• Selected combinatorial problems of computational biology (Q706944) (← links)
• Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
• Partial digest is hard to solve for erroneous input data (Q817811) (← links)
• On the approximability of the simplified partial digest problem (Q967421) (← links)
• Preface: Special issue dedicated to distance geometry (Q1756744) (← links)
• The minimum distance superset problem: formulations and algorithms (Q1756748) (← 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)
• Statistical Aspects in Physical Mapping Application to the Genome of <i>O. oeni</i> Strain GM (Q5714633) (← links)