For faster navigation, this Iframe is preloading the Wikiwand page for Happy mapping.

Happy mapping

In genetics, HAPPY Mapping, first proposed by Paul H. Dear and Peter R. Cook in 1989, is a method used to study the linkage between two or more DNA sequences.[1] According to the Single Molecule Genomics Group, it is "Mapping based on the analysis of approximately HAPloid DNA samples using the PolYmerase chain reaction". In genomics, HAPPY mapping can be applied to assess the synteny and orientation of various DNA sequences across a particular genome - the generation of a "genomic" map.

As with linkage mapping, HAPPY mapping relies on the differential probability of two or more DNA sequences being separated. In genetic mapping, the probability of a recombination event between two genetic loci on the same chromosome is directly proportional to the distance between them. HAPPY mapping replaces recombination with fragmentation - instead of relying on recombination to separate genetic loci, the entire genome is fragmented, for example, by radiation or mechanical shearing. If the DNA is broken on a random basis, the longer the distance between two DNA sequences, the higher the chances of it to break between the two, and vice versa.

HAPPY mapping retains the benefits of genetic mapping while removing some of the problems associated with recombination. I.e., the need for polymorphism, and breeding. Also, recombination can be locale specific whereas breakage of genomic DNA by radiation or mechanical shearing seems to be more random. It has been used to genetically map several organisms.[2][3]

HAPPY mapping has also been adapted to allow the precise analysis of copy-number variation, and in particular the analysis of copy-number changes in cancer.[4]

References

[edit]
  1. ^ Dear PH, Cook PR (September 1989). "Happy mapping: a proposal for linkage mapping the human genome". Nucleic Acids Res. 17 (17): 6795–807. doi:10.1093/nar/17.17.6795. PMC 318413. PMID 2780310.
  2. ^ Piper MB, Bankier AT, Dear PH (December 1998). "A HAPPY map of Cryptosporidium parvum". Genome Res. 8 (12): 1299–307. doi:10.1101/gr.8.12.1299. PMC 310802. PMID 9872984.
  3. ^ Hamilton EP, Dear PH, Rowland T, Saks K, Eisen JA, Orias E (October 2006). "Use of HAPPY mapping for the higher order assembly of the Tetrahymena genome". Genomics. 88 (4): 443–51. doi:10.1016/j.ygeno.2006.05.002. PMC 3169840. PMID 16782302.
  4. ^ McCaughan F, Darai-Ramqvist E, Bankier AT, Konfortov BA, Foster N, George PJ, Rabbitts TH, Kost-Alimova M, Rabbitts PH, Dear PH (November 2008). "Microdissection molecular copy-number counting (microMCC)--unlocking cancer archives with digital PCR". J. Pathol. 216 (3): 307–16. doi:10.1002/path.2413. PMID 18773450.
{{bottomLinkPreText}} {{bottomLinkText}}
Happy mapping
Listen to this article

This browser is not supported by Wikiwand :(
Wikiwand requires a browser with modern capabilities in order to provide you with the best reading experience.
Please download and use one of the following browsers:

This article was just edited, click to reload
This article has been deleted on Wikipedia (Why?)

Back to homepage

Please click Add in the dialog above
Please click Allow in the top-left corner,
then click Install Now in the dialog
Please click Open in the download dialog,
then click Install
Please click the "Downloads" icon in the Safari toolbar, open the first download in the list,
then click Install
{{::$root.activation.text}}

Install Wikiwand

Install on Chrome Install on Firefox
Don't forget to rate us

Tell your friends about Wikiwand!

Gmail Facebook Twitter Link

Enjoying Wikiwand?

Tell your friends and spread the love:
Share on Gmail Share on Facebook Share on Twitter Share on Buffer

Our magic isn't perfect

You can help our automatic cover photo selection by reporting an unsuitable photo.

This photo is visually disturbing This photo is not a good choice

Thank you for helping!


Your input will affect cover photo selection, along with input from other users.

X

Get ready for Wikiwand 2.0 🎉! the new version arrives on September 1st! Don't want to wait?