Next Article in Journal
A Review of Routing Protocols Based on Ant-Like Mobile Agents
Next Article in Special Issue
Sublinear Time Motif Discovery from Multiple Sequences
Previous Article in Journal
Noise Reduction for Nonlinear Nonstationary Time Series Data using Averaging Intrinsic Mode Function
Previous Article in Special Issue
Filtering Degenerate Patterns with Application to Protein Sequence Analysis
Article

Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes

1
Computational Biology Center, IBM T. J. Watson Research, Yorktown Heights, NY 10598, USA
2
Limagrain Europe, Centre de Recherche de Chappes, CS 3911, Route d'Ennezat, Chappes 63720, France
*
Author to whom correspondence should be addressed.
Algorithms 2013, 6(3), 430-441; https://0-doi-org.brum.beds.ac.uk/10.3390/a6030430
Received: 18 March 2013 / Revised: 18 July 2013 / Accepted: 23 July 2013 / Published: 30 July 2013
(This article belongs to the Special Issue Algorithms for Sequence Analysis and Storage)
One of the major challenges in handling realistic forward simulations for plant and animal breeding is the sheer number of markers. Due to advancing technologies, the requirement has quickly grown from hundreds of markers to millions. Most simulators are lagging behind in handling these sizes, since they do not scale well. We present a scheme for representing and manipulating such realistic size genomes, without any loss of information. Usually, the simulation is forward and over tens to hundreds of generations with hundreds of thousands of individuals at each generation. We demonstrate through simulations that our representation can be two orders of magnitude faster and handle at least two orders of magnitude more markers than existing software on realistic breeding scenarios. View Full-Text
Keywords: genome representation; phenotype computation; plant breeding; populationsimulation; segment genome representation; phenotype computation; plant breeding; populationsimulation; segment
Show Figures

Figure 1

MDPI and ACS Style

Haiminen, N.; Utro, F.; Lebreton, C.; Flament, P.; Karaman, Z.; Parida, L. Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes. Algorithms 2013, 6, 430-441. https://0-doi-org.brum.beds.ac.uk/10.3390/a6030430

AMA Style

Haiminen N, Utro F, Lebreton C, Flament P, Karaman Z, Parida L. Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes. Algorithms. 2013; 6(3):430-441. https://0-doi-org.brum.beds.ac.uk/10.3390/a6030430

Chicago/Turabian Style

Haiminen, Niina, Filippo Utro, Claude Lebreton, Pascal Flament, Zivan Karaman, and Laxmi Parida. 2013. "Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes" Algorithms 6, no. 3: 430-441. https://0-doi-org.brum.beds.ac.uk/10.3390/a6030430

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop