Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming.

The double digestion problem for DNA restriction mapping has been proved to be NP-complete and intractable if the numbers of the DNA fragments become large. Several approaches to the problem have been tested and proved to be effective only for small problems. In this paper, we formulate the problem as a mixed-integer linear program (MIP) by following (Waterman, 1995) in a slightly different form. With this formulation and using state-of-the-art integer programming techniques, we can solve randomly generated problems whose search space sizes are many-magnitude larger than previously reported testing sizes.

A physical map of human Alu repeats cleavage by restriction endonucleases.

BACKGROUND: Alu repetitive elements are the abundant sequences in human genome. Diversity of DNA sequences of these elements makes difficult the construction of theoretical patterns of Alu repeats cleavage by restriction endonucleases. We have proposed a method of restriction analysis of Alu repeats sequences in silico. RESULTS: Simple software to analyze Alu repeats database has been suggested and Alu repeats digestion patterns for several restriction enzymes' recognition sites have been constructed. Restriction maps of Alu repeats cleavage for corresponding restriction enzymes have been calculated and plotted. Theoretical data have been compared with experimental results on DNA hydrolysis with restriction enzymes, which we obtained earlier. CONCLUSION: Alu repeats digestions provide the main contribution to the patterns of human chromosomal DNA cleavage. This corresponds to the experimental data on total human DNA hydrolysis with restriction enzymes.

Alignment of optical maps.

We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts, and sizing errors present in optical maps are addressed by our alignment score through calculation of corresponding likelihoods. The size error model is derived through the application of Central Limit Theorem and validated by residual plots collected from real data. Missing cuts and false cuts are modeled as Bernoulli and Poisson events, respectively, as suggested by previous studies. Likelihoods are used to derive an alignment score through calculation of likelihood ratios for a certain hypothesis test. This allows us to achieve maximal descriminative power for the alignment score. Our scoring method is naturally embedded within a well known DP framework for finding optimal alignments.

Lack of association between a GABA receptor 1 gene polymorphism and temporal lobe epilepsy.

PURPOSE: Recently a coding nonsynonymous single-nucleotide polymorphism (SNP; G1465A) in the GABBR1 gene was reported to be associated with the incidence and severity of temporal lobe epilepsy (TLE). To clarify the role of this polymorphism in TLE, we attempted to replicate this study. METHODS: We genotyped 188 unrelated patients with TLE (110 women, 78 men) and 259 controls of middle European descent by a restriction-length polymerase chain reaction (PCR) assay. RESULTS: Only two (0.5%) patients and none of the controls exhibited the heterozygous A/G genotype, which was previously reported to be overrepresented among patients as compared with controls. CONCLUSIONS: Although our study was sufficiently powered, we could not replicate the original association. Potential reasons for this failure could lie in subtle genetic differences between the studied populations or differences in the TLE phenotypes.

A unified framework for mapping quantitative trait loci in bivalent tetraploids using single-dose restriction fragments: a case study from alfalfa.

The development of statistical methodologies for quantitative trait locus (QTL) mapping in polyploids is complicated by complex polysomic inheritance. In this article, we propose a statistical method for mapping QTL in tetraploids undergoing bivalent formation at meiosis by using single-dose restriction fragments. Our method is based on a unified framework, one that uses chromosome bivalent pairing configuration and gametic recombination to discern different mechanisms of gamete formation. Our bivalent polyploid model can not only provide a simultaneous estimation of the linkage and chromosome pairing configuration-a cytological parameter of evolutionary and systematic interest-but also enhances the precision of estimating QTL effects and position by correctly characterizing gene segregation during polyploid meiosis. By using our method and a linkage map constructed in a previous study, we successfully identify several QTL affecting winter hardiness in bivalent tetraploid alfalfa. Moreover, our results reveal significant preferential chromosome pairing at meiosis in an F1 hybrid population, which indicates the importance of reassessing the traditional view of random chromosome segregation in alfalfa.

Visual Cloning 2000: a DNA sequence analysis program.

VC2000 is a recommendable, easy-to-use and affordable program suited particularly to plot maps of both plasmids and linear DNA fragments for the documentation of cloning procedures. It comes with basic tools for sequence analysis that assist this major utility. A special feature of the program is the integration of web-based tools, providing additional analytical power and flexibility. In this way the user is supplied with the latest versions of these applications.

Probabilistic approaches to the use of higher order clone relationships in physical map assembly.

UNLABELLED: Physical map assembly is the inference of genome structure from experimental data. Map assembly depends on the integration of diverse data including sequence tagged site (STS) marker content, clone sizing, and restriction digest fingerprints (RDF). As experimentally measured data, these are uncertain and error prone. Physical map assembly from error free data is straightforward and can be accomplished in linear time in the number of clones, but the assembly of an optimal map from error prone data is an NP-hard problem. We present an alternative approach to physical map assembly that is based on a probabilistic view of the data and seeks to identify those features of the map that can be reliably inferred from the available data. With this approach, we achieve a number of goals. These include the use of multiple data sources, appropriate representation of uncertainties in the underlying data, the use of clone length information in fingerprint map assembly, and the use of higher order information in map assembly. By higher order information, we mean relationships that are not expressible in terms of neighbouring clone relationships. These include triplet and multiple clone overlaps, the uniqueness of STS position, and fingerprint marker locations. In a probabilistic view of physical mapping, we assert that all of the many possible map assemblies are equally likely a priori. Given experimental data, we can only state which assemblies are more likely than others given the experimental observations. Parameters of interest are then derived as likelihood weighted averages over map assemblies. Ideally these averages should be sums or integrals over all possible map assemblies, but computationally this is not feasible for real-world map assembly problems. Instead, sampling is used to asymptotically approach the desired parameters. Software implementing our probabilistic approach to mapping has been written. Assembly of mixed RDF and STS maps containing up to 60 clones can be accomplished on a desktop PC with run times under an hour. AVAILABILITY: http://stl.wustl.edu/software/gibbsmap/.

Construction of DNA restriction maps based on a simplified experiment.

MOTIVATION: A formulation of a new problem of the restriction map construction based on a simplified digestion experiment and a development of an algorithm for solving both ideal and noisy data cases of the introduced problem. RESULTS: A simplified partial digest problem and a branch and cut algorithm for finding the solution of the problem.

Estrogen receptor gene polymorphism in Japanese patients with multiple sclerosis.

Estrogen has been reported to have immunosuppressive functions, and to inhibit the progression of experimental autoimmune encephalomyelitis (EAE), an animal model of multiple sclerosis (MS). Since estrogen shows its biological effects via estrogen receptors (ER), we investigate the possible role of ER genes (ERG) in the pathogenesis of MS. PvuII and XbaI polymorphisms in ERG were detected by PCR-RFLP from the DNA of 79 conventional MS patients and 73 healthy controls. The [P] allele in the profiles in PvuII was significantly more prevalent in MS patients than in the controls (P<0.0005). In the study of XbaI polymorphism, the onset age of MS patients with the Xx genotype was earlier than that of the xx genotype group (mean age+/-S.D.; 22.60+/-8.04, and 27.49+/-9.14, respectively) (P<0.05) by ANOVA followed by Fisher's PLSD. Although the Xx genotype group tended to earlier onset age than the XX genotype group (29.60+/-11.10), this difference did not reach. On the basis of these results, PvuII polymorphism might be associated with susceptibility to MS, and XbaI polymorphism with onset age of MS. ERG polymorphism should be further studied in other populations to improve strategies for treatment of MS.

Algorithms for optical mapping.

Optical mapping is a novel technique for determining the restriction sites on a DNA molecule by directly observing a number of partially digested copies of the molecule under a light microscope. The problem is complicated by uncertainty as to the orientation of the molecules and by erroneous detection of cuts. In this paper we study the problem of constructing a restriction map based on optical mapping data. We give several variants of a polynomial reconstruction algorithm, as well as an algorithm that is exponential in the number of cut sites, and hence is appropriate only for small number of cut sites. We give a simple probabilistic model for data generation and for the errors and prove probabilistic upper and lower bounds on the number of molecules needed by each algorithm in order to obtain a correct map, expressed as a function of the number of cut sites and the error parameters. To the best of our knowledge, this is the first probabilistic analysis of algorithms for the problem. We also provide experimental results confirming that our algorithms are highly effective on simulated data.

An algorithm combining discrete and continuous methods for optical mapping.

Optical mapping is a novel technique for generating the restriction map of a DNA molecule by observing many single, partially digested copies of it, using fluorescence microscopy. The real-life problem is complicated by numerous factors: false positive and false negative cut observations, inaccurate location measurements, unknown orientations, and faulty molecules. We present an algorithm for solving the real-life problem. The algorithm combines continuous optimization and combinatorial algorithms applied to a nonuniform discretization of the data. We present encouraging results on real experimental data and on simulated data.

Sequence assembly validation by multiple restriction digest fragment coverage analysis.

DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. This report examines the possibility of analyzing multiple, independent restriction digests as a method for testing the fidelity of sequence assembly. A dynamic programming algorithm to determine the maximum likelihood alignment of error prone electrophoretic mobility data to the expected fragment mobilities given the consensus sequence and restriction enzymes is derived and used to assess the likelihood of detecting rearrangements in genomic sequencing projects. The method is shown to reliably detect errors in sequence fragment assembly without the necessity of making reference to an overlying physical map. An html form-based interface is available at http:/(/)www.ibc.wustl.edu/services/validate. html.

Mapper: an intelligent restriction mapping tool.

MOTIVATION: To determine the most powerful artificial intelligence techniques for automated restriction mapping, and use them to create a powerful multiple-enzyme restriction mapping tool. RESULTS: The most effective search engine utilized model-driven exhaustive search and a form of binary logic pruning based on Pratt's separation theory. Additional experimentation led to the development of an input preprocessing module which significantly speeds up searches, and an output post-processing module which enables users to analyze large solution sets and reduce their apparent complexity. AVAILABILITY: An executable version of the resultant tool, Mapper, can be downloaded from our Web site (http://www.ai.eecs.uic.edu) by selecting the 'Software' option. CONTACT: nelson@eecs.uic.edu (http://www.ai.eecs.uic.edu/ñelson).