Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    INCONSISTENCIES BETWEEN MAPS OF HUMAN CHROMOSOME 22 CORRELATE WITH INCREASED FREQUENCY OF DISEASE-RELATED LOCI

    The relationships between genetic or radiation hybrid (RH) and sequence maps of chromosome 22 have been reconsidered based on the sequence map. Integrated maps have been constructed by retaining only common markers between genetic or RH maps and the sequence map. Local inversions of markers have been detected. Ratios between either genetic or RH distances and sequence-based distances have been calculated for each map interval. Hot zones for recombination or radiation breakage have been delineated by merging together intervals displaying high distance ratios and located close to each other for sequence-constrained RH maps, and for female and male genetic maps. A statistically significant positive correlation was found between the distribution of disease-related genes and the hot zones for recombination or radiation breakage on both female genetic and Stanford-G3 RH maps. This observation indicates that investigation of chromosomal regions displaying inconsistencies between RH or genetic linkage and sequence-based maps can accelerate the initial phase of identification of disease-associated genes.

  • chapterNo Access

    ON THE ACCURATE CONSTRUCTION OF CONSENSUS GENETIC MAPS

    We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The problem is to build a consensus map, which includes and is consistent with all (or, the vast majority of) the markers in the individual maps. When markers in the input maps have ordering conflicts, the resulting consensus map will contain cycles. We formulate the problem of resolving cycles in a combinatorial optimization framework, which in turn is expressed as an integer linear program. A faster approximation algorithm is proposed, and an additional speed-up heuristic is developed. According to an extensive set of experimental results, our tool is consistently better than JOINMAP, both in terms of accuracy and running time.