2023
DOI: 10.3389/fgene.2023.1049988
|View full text |Cite
|
Sign up to set email alerts
|

Smooth Descent: A ploidy-aware algorithm to improve linkage mapping in the presence of genotyping errors

Abstract: Linkage mapping is an approach to order markers based on recombination events. Mapping algorithms cannot easily handle genotyping errors, which are common in high-throughput genotyping data. To solve this issue, strategies have been developed, aimed mostly at identifying and eliminating these errors. One such strategy is SMOOTH, an iterative algorithm to detect genotyping errors. Unlike other approaches, SMOOTH can also be used to impute the most probable alternative genotypes, but its application is limited t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 49 publications
(71 reference statements)
0
4
0
Order By: Relevance
“…Additionally, Bilton et al (2018) developed a method based on the Lander-Green hidden Markov model and implemented in the software GUSMap to account for sequencing errors in GBS data and reduce upward bias in genetic map lengths in outbred populations, especially when read depth is low. Navarro et al (2023) developed an iterative algorithm, implemented in the software Smooth Descent, to detect errors in low-depth GBS data and impute the most probable alternative genotypes, which resulted in genetic maps with improved marker order and map lengths. Smooth descent requires accurate parental phasing, which would necessitate high-depth long-read sequencing of the parents; if marker order can be corrected using a reference genome, error correction of markers can still be performed with this software.…”
Section: Map-construction Methods Depthmentioning
confidence: 99%
“…Additionally, Bilton et al (2018) developed a method based on the Lander-Green hidden Markov model and implemented in the software GUSMap to account for sequencing errors in GBS data and reduce upward bias in genetic map lengths in outbred populations, especially when read depth is low. Navarro et al (2023) developed an iterative algorithm, implemented in the software Smooth Descent, to detect errors in low-depth GBS data and impute the most probable alternative genotypes, which resulted in genetic maps with improved marker order and map lengths. Smooth descent requires accurate parental phasing, which would necessitate high-depth long-read sequencing of the parents; if marker order can be corrected using a reference genome, error correction of markers can still be performed with this software.…”
Section: Map-construction Methods Depthmentioning
confidence: 99%
“…ConGenR rapidly determines consensus genotypes and estimates genotyping errors from replicated genetic samples [ 27 ]. Smooth and Smooth-Descent predict genotyping errors, which improve the map quality and correctness of marker sequence [ 28 , 29 ].…”
Section: Introductionmentioning
confidence: 99%
“…Phased bin-markers were visualized, and phasing was manually improved, when necessary, with the function manualPhasing before being formatted for Smooth Descent (Thérèse Navarro et al, 2023) with the function formatSD.…”
Section: Clustering Of Adjacent Sequence Variants Into Robust Marker ...mentioning
confidence: 99%
“…The segregation data of bin-markers obtained with OutcrossSeqDiploidR were corrected for putatively erroneous data points with the algorithm Smooth Decent following the package vignette (Thérèse Navarro et al, 2023). Briefly, Smooth Decent makes use of identity-by-descent probabilities, in our case based on the physical order of bin-markers, to detect putative genotyping errors and impute the most probable genotype given the data points of flanking markers.…”
Section: Correcting Genotyping Errors With Smooth Descentmentioning
confidence: 99%
See 1 more Smart Citation