Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 668

The DOI matches its Crossref record.

Avoiding Recomputation in Linkage Analysis

Schäffer, Alejandro A., Gupta, Sandeep K., Shriram, K., Cottingham, Jr., Robert W.·1994·Human Heredity

Abstract

We describe four improvements we have implemented in a version of the genetic linkage analysis programs in the LINKAGE package: subdivision of recombination classes, better handling of loops, better coordination between the optimization and output routines, and a checkpointing facility. The unifying theme for all the improvements is to store a small amount of data to avoid expensive recomputation of known results. The subdivision of recombination classes improves on a method of Lathrop and Lalouel [Am J Hum Genet 1988;42:498-505]. The new method of handling loops extends a proposal of Lange and Elston [Hum Hered 1975;25:95-105] for loopless pedigrees with multiple nuclear families at the earliest generation. From a practical point of view, the most important improvement may be the checkpointing facility which allows the user to carry out linkage computations that are much longer than the mean-time-to-failure of the underlying computer.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1159/000154222

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 668

Metadata

Authors
Schäffer, A. A., Gupta, S. K., Shriram, K., & Cottingham, Jr.
Venue
Human Heredity
Publisher
S. Karger AG
Published
1994
Volume
44
Issue
4
Pages
225-237
ISSN
  • 0001-5652 (ISSN-L)
  • 1423-0062
OpenAlex
W2061833150
Cited by
668
References
0
FWCI
23.28
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Avoiding Recomputation in Linkage Analysis. https://app.cochat.ai/papers/10.1159/000154222
The paper
Schäffer, A. A., Gupta, S. K., Shriram, K., & Cottingham, Jr. (1994). Avoiding Recomputation in Linkage Analysis. Human Heredity. https://doi.org/10.1159/000154222

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.