skip to main content
10.1145/1566445.1566515acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
extended-abstract

Searching for adaptive resource allocation strategies in Arabidopsis lyrata using genetic algorithms

Published:19 March 2009Publication History

ABSTRACT

The perennial plant Arabidopsis lyrata, whose genome has recently been sequenced, shows considerable adaptation to local climates, thus making it an ideal plant for analyzing the genetics of resource allocation. My research focuses on determining how resource allocation traits for reproduction and growth and maintenance may be controlled genetically in different populations. A simulation is developed to analyze the effectiveness of a particular resource allocation strategy, and a genetic algorithm is implemented to search through the strategy space and identify the most adaptive strategies for particular environments.

References

  1. M. J. Clauss and M. A. Koch. Poorly known relatives of Arabidopsis thaliana. Trends in Plant Science, 11(9):449--459, September 2006.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. E. Eiben. and J. E. Smith Introduction to Evolutionary Computing. Springer, Berlin, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, Cambridge, Mass, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. L. Remington. Unpublished data, 2008--2009.Google ScholarGoogle Scholar

Index Terms

  1. Searching for adaptive resource allocation strategies in Arabidopsis lyrata using genetic algorithms

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Other conferences
            ACM-SE 47: Proceedings of the 47th Annual Southeast Regional Conference
            March 2009
            430 pages
            ISBN:9781605584218
            DOI:10.1145/1566445

            Copyright © 2009 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 19 March 2009

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • extended-abstract

            Acceptance Rates

            Overall Acceptance Rate178of377submissions,47%
          • Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader