1992
DOI: 10.1002/gepi.1370090507
|View full text |Cite
|
Sign up to set email alerts
|

Preliminary ordering of multiple linked loci using pairwise linkage data

Abstract: A method is presented for the preliminary ordering of loci on a chromosome using pairwise linkage data. The method is based on the biologically reasonable assumption that the "true" order of a set of linked loci will be the one that minimizes the total length of the chromosome segment. Here the "length" is defined as the sum of adjacent recombination fractions. The method searches for the optimal order, represented by a minimum distance map (MDMAP), even when it is not possible to examine the n!/2 possible dis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
19
0

Year Published

2003
2003
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(19 citation statements)
references
References 15 publications
0
19
0
Order By: Relevance
“…A similar situation also occurs among loci ABA3, ABG484, Pgk1, and ABR315. In comparison, there are considerable differences between maps B and C. It is noteworthy that sums of adjacent distances on linkage maps A, B, and C are, respectively, 132.8, 148.5, and 151 cM, which suggests that linkage map A is the best among these three linkage maps according to the principle of minimum SARF (Falk 1992;Liu 1998). …”
Section: Numerical Examplesmentioning
confidence: 97%
See 2 more Smart Citations
“…A similar situation also occurs among loci ABA3, ABG484, Pgk1, and ABR315. In comparison, there are considerable differences between maps B and C. It is noteworthy that sums of adjacent distances on linkage maps A, B, and C are, respectively, 132.8, 148.5, and 151 cM, which suggests that linkage map A is the best among these three linkage maps according to the principle of minimum SARF (Falk 1992;Liu 1998). …”
Section: Numerical Examplesmentioning
confidence: 97%
“…The construction of linkage maps has been recognized as a special case of the traveling salesman problem (TSP) (Liu 1998). The TSP is a classical non-deterministic polynomial time (NP)-complete problem (Wilson 1988;Olson and Boehnke 1990;Falk 1992) that has attracted the attention of mathematicians and computer scientists. Currently, there are two approaches to tackle the problem.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…This criterion, called the sum of adjacent recombination fractions (SARF), is used as a criterion in locus ordering (Olson and Boehnke 1990, Falk 1992, Liu 1998, Mester et al 2003b. When the absolute values of log likelihood (ALL) between loci are considered to correspond to the distance between the TSP cities, our system seeks the order minimizing…”
Section: Algorithmmentioning
confidence: 99%
“…Linkage associations among segregating markers were determined independently for each pedigree (cutoffs: LOD C 3.0 and r B 0.40). Independent associations were then ordered based upon the minimum sum of adjacent recombination fractions (SARF) and tested by Log-likelihood estimates (Falk 1992). All possible marker orders were constructed and marker order was established using the smallest estimated Kosambi map distances and logarithm of the likelihood for each map length [map Log-likelihood].…”
Section: Comparative Mapping Of the Z Chromosomementioning
confidence: 99%