Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Linear Time Algorithms to Construct Populations Fitting Multiple Constraint Distributions at Genomic Scales.

IEEE/ACM transactions on computational biology and bioinformatics - 1 Jan 2000

Siragusa Enrico, Haiminen Niina, Utro Filippo, Parida Laxmi

Abstract excerpt

Computer simulations can be used to study population genetic methods, models, and parameters, as well as to predict potential outcomes. For example, in plant populations, predicting the outcome of breeding operations can be studied using simulations. In-silico construction of populations with pre-specified characteristics is an important task in breeding optimization and other population genetic studies. We...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Computational Biology

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Computer Simulation

Share to DNA, Plant

Share to Gene Dosage

Share to Genes, Plant

Share to Linear Models

Share to Linkage Disequilibrium

Source

Identifiers

PMID: 28991752
DOI: 10.1109/TCBB.2017.2760879

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 4 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Linear Time Algorithms to Construct Populations Fitting Multiple Constraint Distributions at Genomic Scales.PMID 28991752Read ↗

MDM: a program to compute fully informative genotype frequencies in complex breeding schemes.Semantic proximity Read ↗

SNP genotyping and parameter estimation in polyploids using low-coverage sequencing data.Semantic proximity Read ↗

A heuristic method for fast and accurate phasing and imputation of single-nucleotide polymorphism data in bi-parental plant populations.Semantic proximity Read ↗

GeneEvolve: a fast and memory efficient forward-time simulator of realistic whole-genome sequence and SNP data.Semantic proximity Read ↗

Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of SNP sequences in populations.Semantic proximity Read ↗

De novo construction of polyploid linkage maps using discrete graphical models.Semantic proximity Read ↗

genomicSimulation: fast R functions for stochastic simulation of breeding programs.Semantic proximity Read ↗

Efficient Coalescent Simulation and Genealogical Analysis for Large Sample Sizes.Semantic proximity Read ↗

SPEARS: Standard Performance Evaluation of Ancestral haplotype Reconstruction through Simulation.Semantic proximity Read ↗

A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information.Semantic proximity Read ↗

TriPoly: haplotype estimation for polyploids using sequencing data of related individuals.Semantic proximity Read ↗

DHOEM: a statistical simulation software for simulating new markers in real SNP marker data.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.