Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Pedigree Analysis01:35

Pedigree Analysis

Overview
Pedigree Analysis01:35

Pedigree Analysis

Overview
Law of Segregation01:49

Law of Segregation

When crossing pea plants, Mendel noticed that one of the parental traits would sometimes disappear in the first generation of offspring, called the F1 generation, and could reappear in the next generation (F2). He concluded that one of the traits must be dominant over the other, thereby causing masking of one trait in the F1 generation. When he crossed the F1 plants, he found that 75% of the offspring in the F2 generation had the dominant phenotype, while 25% had the recessive phenotype.
Incomplete Dominance01:43

Incomplete Dominance

Gregor Mendel's work (1822 - 1884) was primarily focused on pea plants. Through his initial experiments, he determined that every gene in a diploid cell has two variants called alleles inherited from each parent. He suggested that amongst these two alleles, one allele is dominant in character and the other recessive. The combination of alleles determines the phenotype of a gene in an organism.
Probability Laws01:49

Probability Laws

Overview
Punnett Squares01:00

Punnett Squares

Overview

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The (in)dependence of single-cell data inferences on model constructs.

Forensic science international. Genetics·2025
Same author

Consistent estimation of Y STR haplotype probabilities.

Forensic science international. Genetics·2020
Same author

Computation of marginal distributions of peak-heights in electropherograms for analysing single source and mixture STR DNA samples.

Forensic science international. Genetics·2018
Same author

Efficient maximum likelihood pedigree reconstruction.

Theoretical population biology·2009
Same author

Validation of an STR peak area model.

Forensic science international. Genetics·2009
Same author

A clustering algorithm using DNA marker information for sub-pedigree reconstruction.

Journal of forensic sciences·2003
Same journal

Applying invasion criterion to cultural evolution.

Theoretical population biology·2026
Same journal

The joint spectrum over trees under the Kingman coalescent with varying population.

Theoretical population biology·2026
Same journal

Statistical test to compare the linkage model and the admixture model based on central limit results.

Theoretical population biology·2026
Same journal

Threshold dynamics in age-structured distributions with expanding support: A unified mathematical framework.

Theoretical population biology·2026
Same journal

Mechanistic-statistical model for the expansion of ash dieback.

Theoretical population biology·2026
Same journal

Dynamics of an intraguild predation system with optimal foraging and harvesting.

Theoretical population biology·2026
See all related articles

Related Experiment Video

Updated: May 16, 2026

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

A simple greedy algorithm for reconstructing pedigrees.

Robert G Cowell1

  • 1Cass Business School, 106 Bunhill Row, London EC1Y 8TZ, UK. rgc@city.ac.uk

Theoretical Population Biology
|November 21, 2012
PubMed
Summary
This summary is machine-generated.

This study presents a novel greedy algorithm for determining family relationships using short tandem repeat (STR) genetic data. The method efficiently identifies high-likelihood pedigrees without needing age or sex information.

More Related Videos

Frequency and Distribution of Crossovers in Caenorhabditis elegans Meiosis by SNP Genotyping using Real-time PCR
06:18

Frequency and Distribution of Crossovers in Caenorhabditis elegans Meiosis by SNP Genotyping using Real-time PCR

Published on: July 11, 2025

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Related Experiment Videos

Last Updated: May 16, 2026

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

Frequency and Distribution of Crossovers in Caenorhabditis elegans Meiosis by SNP Genotyping using Real-time PCR
06:18

Frequency and Distribution of Crossovers in Caenorhabditis elegans Meiosis by SNP Genotyping using Real-time PCR

Published on: July 11, 2025

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Area of Science:

  • Genetics
  • Bioinformatics
  • Computational Biology

Background:

  • Pedigree identification is crucial for genetic studies.
  • Existing methods may require extensive demographic data.
  • Micro-satellite (STR) markers offer valuable genetic information for relationship inference.

Purpose of the Study:

  • To introduce a novel greedy algorithm for high-likelihood pedigree searching.
  • To leverage short tandem repeat (STR) genotype data for pedigree learning.
  • To develop a method adaptable to various genetic datasets.

Main Methods:

  • A greedy search algorithm is employed.
  • Utilizes micro-satellite (STR) genotype information from related individuals.
  • Algorithm designed to be flexible, optionally incorporating age and sex data.

Main Results:

  • The algorithm was successfully applied to both human and non-human genetic data.
  • Demonstrated effectiveness in a simulation study.
  • The greedy approach in pedigree learning is shown to be novel and effective.

Conclusions:

  • The developed greedy algorithm provides an efficient method for pedigree identification using STR data.
  • The approach is robust and applicable across different species.
  • This method advances the field of computational genetics and relationship inference.