Approximation algorithms for a genetic diagnostics problem.

doi:10.1089/cmb.1998.5.9

Back to search

Article

Approximation algorithms for a genetic diagnostics problem.

Journal of computational biology : a journal of computational molecular cell biology - 1 Jan 1998

Kosaraju S R, Schäffer A A, Biesecker L G

Abstract excerpt

We define and study a combinatorial problem called WEIGHTED DIAGNOSTIC COVER (WDC) that models the use of a laboratory technique called genotyping in the diagnosis of an important class of chromosomal aberrations. An optimal solution to WDC would enable us to define a genetic assay that maximizes the diagnostic power for a specified cost of laboratory work. We develop approximation algorithms for WDC by making...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Genetic Markers

Share to Genotype

Share to Intellectual Disability

Share to Models, Genetic

Share to Phenotype

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 8 closest

Approximation algorithms for a genetic diagnostics problem.PMID 9541868Read

Payer coverage policies for multigene testsSemantic proximity Read

Data simulation for GAW9 problems 1 and 2.Semantic proximity Read

Multiplexing schemes for generic SNP genotyping assays.Semantic proximity Read

Towards optimally multiplexed applications of universal arrays.Semantic proximity Read

An integer programming formulation of the parsimonious loss of heterozygosity problem.Semantic proximity Read

Efficient combinatorial algorithms for DNA microarray designSemantic proximity Read

Multiplexing schemes for generic SNP genotyping assays.Semantic proximity Read

The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformaticsSemantic proximity Read