Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-29T05:51:46.186Z Has data issue: false hasContentIssue false

7 - How to find the best map order

Published online by Cambridge University Press:  05 August 2013

J. W. Van Ooijen  and
J. Jansen
J. W. Van Ooijen
Affiliation:
Kyazma B.V., Wageningen, The Netherlands
J. Jansen
Affiliation:
Biometris, Wageningen University and Research Centre, The Netherlands
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Genetic Mapping in Experimental Populations , pp. 87 - 100
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aarts, J. K. & Lenstra, E. L. (2003). Local Search in Combinatorial Optimization. Princeton, NJ: Princeton University Press.Google Scholar
Applegate, D. L., Bixby, R. E., Chvátal, V. & Cook, W. J. (2007). The Traveling Salesman Problem: a Computational Study. Princeton, NJ: Princeton University Press.Google Scholar
Buetow, K. H. & Chakravarti, A. (1987). Multipoint gene mapping using seriation. I. General methods. American Journal of Human Genetics, 41, 180–8.Google ScholarPubMed
Cartwright, D. A., Troggio, M., Velasco, R. &Gutin, A. (2007). Genetic mapping in the presence of genotyping errors. Genetics, 176, 2521–7.CrossRefGoogle ScholarPubMed
Colorni, A., Dorigo, M. & Maniezzo, V. (1992). An investigation of some properties of an ant algorithm. In Proceedings of the Second International Conference on Parallel Problem Solving from Nature, eds. Männer, R. & Manderick, B.Amsterdam, The Netherlands: Elsevier, 509–20.Google Scholar
Dorigo, M. (1992). Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, Italy.Google Scholar
Ellis, T. H. N. (1999). Neighbour mapping as a method for ordering genetic markers. Genetics Research, 69, 35–43.CrossRefGoogle Scholar
Gaspin, C. & Schiex, T. (1997). Genetic algorithms for genetic mapping. In Proceedings of Evolution Artificielle 97. Nîmes, France.Google Scholar
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13, 533–49.CrossRefGoogle Scholar
Hackett, C. A., Pande, B. & Bryan, G. J. (2003). Constructing linkage maps in autotetraploid species using simulated annealing. Theoretical and Applied Genetics, 106, 1107–15.CrossRefGoogle ScholarPubMed
Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press.Google Scholar
Iwata, H. & Ninomiya, S. (2006). AntMap: constructing genetic linkage maps using an ant colony optimization algorithm. Breeding Science, 56, 371–7.CrossRefGoogle Scholar
Jansen, J. (2005). Construction of linkage maps in full-sib families of diploid outbreeding species by minimizing the number of recombinations in hidden inheritance vectors. Genetics, 170, 2013–25.CrossRefGoogle ScholarPubMed
Jansen, J. (2009). Ordering dominant markers in F2 populations. Euphytica, 165, 401–17.CrossRefGoogle Scholar
Jansen, J., De Jong, A. G. & Van Ooijen, J. W. (2001). Constructing dense genetic linkage maps. Theoretical and Applied Genetics, 102, 1113–22.CrossRefGoogle Scholar
Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–80.CrossRefGoogle ScholarPubMed
Mester, D., Ronin, Y., Minkov, D., Nevo, E. & Korol, A. (2003a). Constructing large scale genetic maps using evolutionary strategy algorithm. Genetics, 165, 2269–82.Google ScholarPubMed
Mester, D., Ronin, Y. I., Hu, Y., Peng, J., Nevo, E. & Korol, A. B. (2003b). Efficient multipoint mapping: making use of dominant repulsion-phase markers. Theoretical and Applied Genetics, 107, 1102–12.CrossRefGoogle ScholarPubMed
Newell, W. R., Mott, R., Beck, S. & Lehrach, H. (1995). Construction of genetic maps using distance geometry. Genomics 30, 59–70. [Erratum Genomics, 34, 283, 1996.]CrossRefGoogle ScholarPubMed
Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Stuttgart, Germany:Fromman-Holzboog.Google Scholar
Schiex, T. &Gaspin, C. (1997). CarthaGene: constructing and joining maximum likelihood genetic maps. In Proceedings of the Fifth International Conference on Intelligent Systems for Molecular Biology 97. Halkidiki, Greece.Google Scholar
Stam, P. (1993). Construction of integrated genetic linkage maps by means of a new computer package: JoinMap. Plant Journal, 3, 739–44.CrossRefGoogle Scholar
Tan, Y. D. & Fu, Y. X. (2006). A novel method for estimating linkage maps. Genetics, 173, 2383–90.CrossRefGoogle ScholarPubMed
Van Os, H., Stam, P., Visser, R. G. F. & Van Eck, H. J. (2005). RECORD: a novel method for ordering loci on a genetic linkage map. Theoretical and Applied Genetics, 112, 30–40.CrossRefGoogle ScholarPubMed
Weeks, D. E. & Lange, K. (1987). Preliminary ranking procedures for multilocus ordering. Genomics, 1, 236–42.CrossRefGoogle ScholarPubMed
Wu, Y., Bhat, P., Close, T. J. & Lonardi, S. (2008). Efficient and accurate construction of genetic linkage maps from the minimum spanning tree of a graph. PLoS Genetics, 4, e1000212.CrossRefGoogle ScholarPubMed

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×