PubMed Health⌕ Search

Biomedical subjects

J R O'Connell

Publications and source records attributed to J R O'Connell.

At least 19 recordsLinked to original sources
PubMed2006

The value of molecular haplotypes in a family-based linkage study.

Novel methods that could improve the power of conventional methods of gene discovery for complex diseases should be investigated. In a simulation study, we aimed to investigate the value of molecular haplotypes in the context of a family-based linkage study. The term "haplotype" (or "haploid genotype") refers to syntenic alleles inherited on a single chromosome, and we use the term "molecular haplotype" to refer to haplotypes that have been determined directly by use of a molecular technique such as long-range allele-specific polymerase chain reaction. In our study, we simulated genotype and phenotype data and then compared the powers of analyzing these data under the assumptions that various levels of information from molecular haplotypes were available. (This information was available because of the simulation procedure.) Several conclusions can be drawn. First, as expected, when genetic homogeneity is expected or when marker data are complete, it is not efficient to generate molecular haplotyping information. However, with levels of heterogeneity and missing data patterns typical of complex diseases, we observed a 23%-77% relative increase in the power to detect linkage in the presence of heterogeneity with heterogeneity LOD scores >3.0 when all individuals are molecularly haplotyped (compared with the power when only standard genotypes are used). Furthermore, our simulations indicate that most of the increase in power can be achieved by molecularly haplotyping a single individual in each family, thereby making molecular haplotyping a valuable strategy for increasing the power of gene mapping studies of complex diseases. Maximization of power, given an existing family set, can be particularly important for late-onset, often-fatal diseases such as cancer, for which informative families are difficult to collect.

Computer Simulation↗
PubMed2001

Model-free linkage analysis: performance under real-world conditions.

The simulated data of the Genetic Analysis Workshop 12 problem set affords an ideal environment for testing real-world performance of model-free linkage analysis methods. To this end, we applied three different methods of model-free linkage analysis: mod scores [Hodge and Elston, Genet Epidemiol 11:329-42, 1994], maximized maximum lod score (MMLS) [Greenberg et al., Am J Hum Genet 63:870-9, 1998], and nonparametric linkage (NPL) scores [Whittemore and Halpern, Biometrics 50:118-27, 1994], as well as standard parametric linkage analysis to the detection of major gene 6 (MG6) using only the qualitative disease status data. Our results indicate that both mod scores and NPL scores perform well, even in the presence of an extremely complicated disease model. MMLS analysis did not perform well, except at the disease locus itself.

Chromosome Mapping↗
PubMed2001

Comparison of likelihood approaches for combined segregation and linkage analysis of a complex disease and a candidate gene marker under different ascertainment schemes.

We compared two joint likelihood approaches, with complete (L1) or without (L2) linkage disequilibrium, under different ascertainment schemes, for the genetic analysis of the disease trait and marker gene 1 in replicate 42. Joint likelihoods were computed without a correction for the selection scheme. For the different sampling schemes we have explored, our results suggest that L1 is a more powerful approach than L2 to detect major gene and covariate effects as well as to identify accurately gene x covariate interaction effects in a common and complex disease such as the Genetic Analysis Workshop 12 MG6 simulated trait.

Adult↗
PubMed2001

Rapid multipoint linkage analysis via inheritance vectors in the Elston-Stewart algorithm.

The calculation of multipoint likelihoods of pedigree data is crucial for extracting the full available information needed for both parametric and nonparametric linkage analysis. Recent mathematical advances in both the Elston-Stewart and Lander-Green algorithms for computing exact multipoint likelihoods of pedigree data have enabled researchers to analyze data sets containing more markers and more individuals both faster and more efficiently. This paper presents novel algorithms that further extend the computational boundary of the Elston-Stewart algorithm. They have been implemented into the software package VITESSE v. 2 and are shown to be several orders of magnitude faster than the original implementation of the Elston-Stewart algorithm in VITESSE v. 1 on a variety of real pedigree data. VITESSE v. 2 was faster by a factor ranging from 168 to over 1,700 on these data sets, thus making a qualitative difference in the analysis. The main algorithm is based on the faster computation of the conditional probability of a component nuclear family within the pedigree by summing over the joint genotypes of the children instead of the parents as done in the VITESSE v. 1. This change in summation allows the parent-child transmission part of the calculation to be not only computed for each parent separately, but also for each locus separately by using inheritance vectors as is done in the Lander-Green algorithm. Computing both of these separately can lead to substantial computational savings. The use of inheritance vectors in the nuclear family calculation represents a partial synthesis of the techniques of the Lander-Green algorithm into the Elston-Stewart algorithm. In addition, the technique of local set recoding is introduced to further reduce the complexity of the nuclear family computation. These new algorithms, however, are not universally faster on all types of pedigree data compared to the method implemented in VITESSE v. 1 of summing over the parents. Therefore, a hybrid algorithm is introduced which combines the strength of both summation methods by using a numerical heuristic to decide which of the two to use for a given nuclear family within the pedigree and is shown to be faster than either method on its own. Finally, this paper discusses various complexity issues regarding both the Elston-Stewart and Lander-Green algorithms and possible future directions of further synthesis.

Algorithms↗
PubMed2000

Zero-recombinant haplotyping: applications to fine mapping using SNPs.

As the number of single nucleotide polymorphisms (SNPs) available for genetic analysis increases, researchers will be saturating smaller and smaller regions of the genome with these biallelic markers in an effort to fine map complex diseases. An important tool in this fine-mapping effort is haplotyping. Algorithms are presented that find all possible haplotype configurations of the pedigree data under the assumption that there are no recombinants between the markers. These configurations can be used to estimate the haplotype frequencies, and identify the most common haplotypes in the data. These algorithms have been implemented into a software program (ZAPLO), and were tested on a published data set.

Algorithms↗
PubMed2000

A new locus for dominant drusen and macular degeneration maps to chromosome 6q14.

PURPOSE: To report the localization of a gene causing drusen and macular degeneration in a previously undescribed North American family. METHODS: Genetic mapping studies were performed using linkage analysis in a single family with drusen and atrophic macular degeneration. RESULTS: The clinical manifestations in this family ranged from fine macular drusen in asymptomatic middle-aged individuals to atrophic macular lesions in two children and two elderly patients. We mapped the gene to chromosome 6q14 between markers D6S2258 and D6S1644. CONCLUSIONS: In a family with autosomal dominant drusen and atrophic macular degeneration, the gene maps to a 3.2-cM region on chromosome 6q14. This locus appears to be distinct from, but adjacent to, the loci for cone-rod dystrophy 7 (CORD7) and North Carolina macular dystrophy (MCDR1). Future identification of the gene responsible for the disease in this family will provide a better understanding of macular degeneration.

Adolescent↗
PubMed2000

Evidence of genetic heterogeneity for hereditary gingival fibromatosis.

Hereditary Gingival Fibromatosis (HGF) is the most common genetic form of gingival fibromatosis. The condition is most frequently reported to be transmitted as an autosomal-dominant trait, but autosomal-recessive inheritance has also been reported. The clinical presentation of HGF is variable, both in the distribution (number of teeth involved) and in the degree (severity) of expression. It is unknown if the variable clinical expression of HGF in different families is due to variable expression of a common gene mutation, allelic mutations, or non-allelic mutations. The apparently different modes of Mendelian inheritance of HGF suggest genetic heterogeneity. A gene locus for HGF has been localized to a 37-cM genetic interval on chromosome 2p21-p22 (D2S1352, Zmax = 5.10, theta = 0.00) flanked by D2S1788 and D2S441. To evaluate the generality of this linkage, we tested linkage with 9 markers from this candidate region in another large family, segregating for an autosomal-dominant form of generalized HGF, and found no support for linkage with any of these markers. Furthermore, statistical tests of this apparent heterogeneity were highly significant. Analysis of these data provides direct evidence that at least two genetically distinct loci are responsible for autosomal-dominant hereditary gingival fibromatosis.

Algorithms↗
PubMed1999

An optimal algorithm for automatic genotype elimination.

In an effort to accelerate likelihood computations on pedigrees, Lange and Goradia defined a genotype-elimination algorithm that aims to identify those genotypes that need not be considered during the likelihood computation. For pedigrees without loops, they showed that their algorithm was optimal, in the sense that it identified all genotypes that lead to a Mendelian inconsistency. Their algorithm, however, is not optimal for pedigrees with loops, which continue to pose daunting computational challenges. We present here a simple extension of the Lange-Goradia algorithm that we prove is optimal on pedigrees with loops, and we give examples of how our new algorithm can be used to detect genotyping errors. We also introduce a more efficient and faster algorithm for carrying out the fundamental step in the Lange-Goradia algorithm-namely, genotype elimination within a nuclear family. Finally, we improve a common algorithm for computing the likelihood of a pedigree with multiple loops. This algorithm breaks each loop by duplicating a person in that loop and then carrying out a separate likelihood calculation for each vector of possible genotypes of the loop breakers. This algorithm, however, does unnecessary computations when the loop-breaker vector is inconsistent. In this paper we present a new recursive loop breaker-elimination algorithm that solves this problem and illustrate its effectiveness on a pedigree with six loops.

Algorithms↗
PubMed1998

Linkage analysis of X-linked cone-rod dystrophy: localization to Xp11.4 and definition of a locus distinct from RP2 and RP3.

Progressive X-linked cone-rod dystrophy (COD1) is a retinal disease affecting primarily the cone photoreceptors. The COD1 locus originally was localized, by the study of three independent families, to a region between Xp11.3 and Xp21.1, encompassing the retinitis pigmentosa (RP) 3 locus. We have refined the COD1 locus to a limited region of Xp11.4, using two families reported elsewhere and a new extended family. Genotype analysis was performed by use of eight microsatellite markers (tel-M6CA, DXS1068, DXS1058, DXS993, DXS228, DXS1201, DXS1003, and DXS1055-cent), spanning a distance of 20 cM. Nine-point linkage analysis, by use of the VITESSE program for X-linked disorders, established a maximum LOD score (17.5) between markers DXS1058 and DXS993, spanning 4.0 cM. Two additional markers, DXS977 and DXS556, which map between DXS1058 and DXS993, were used to further narrow the critical region. The RP3 gene, RPGR, was excluded on the basis of two obligate recombinants, observed in two independent families. In a third family, linkage analysis did not exclude the RPGR locus. The entire coding region of the RPGR gene from two affected males from family 2 was sequenced and was found to be normal. Haplotype analysis of two family branches, containing three obligate recombinants, two affected and one unaffected, defined the COD1 locus as distal to DXS993 and proximal to DXS556, a distance of approximately 1.0 Mb. This study excludes COD1 as an allelic variant of RP3 and establishes a novel locus that is sufficiently defined for positional cloning.

Alleles↗
PubMed1998

PedCheck: a program for identification of genotype incompatibilities in linkage analysis.

Prior to performance of linkage analysis, elimination of all Mendelian inconsistencies in the pedigree data is essential. Often, identification of erroneous genotypes by visual inspection can be very difficult and time consuming. In fact, sometimes the errors are not recognized until the stage of running linkage-analysis software. The effort then required to find the erroneous genotypes and to cross-reference pedigree and marker data that may have been recoded and renumbered can be not only tedious but also quite daunting, in the case of very large pedigrees. We have implemented four error-checking algorithms in a new computer program, PedCheck, which will assist researchers in identifying all Mendelian inconsistencies in pedigree data and will provide them with useful and detailed diagnostic information to help resolve the errors. Our program, which uses many of the algorithms implemented in VITESSE, handles large data sets quickly and efficiently, accepts a variety of input formats, and offers various error-checking algorithms that match the subtlety of the pedigree error. These algorithms range from simple parent-offspring-compatibility checks to a single-locus likelihood-based statistic that identifies and ranks the individuals most likely to be in error. We use various real data sets to illustrate the power and effectiveness of our program.

Algorithms↗
PubMed1997

Analysis of a complex oligogenic disease.

Our analysis of GAW10 problem 2 data set consisted of linear regression analysis followed by linkage analysis. The linear regression analysis allowed some exploration of the relationships between the quantitative variables. Furthermore, it isolated some of the components of certain quantitative variables that were not due to a major locus and facilitated the linkage analysis that followed. For the linkage analysis, we used MAPMAKER/SIBS and the SIBPAL program from S.A.G.E. We found linkage of Q4 to chromosome 8. Analysis using the residuals of Q1 and Q3 showed linkage to chromosomes 5 and 4, respectively.

Female↗
PubMed1995

The VITESSE algorithm for rapid exact multilocus linkage analysis via genotype set-recoding and fuzzy inheritance.

As genetic marker maps have improved, multipoint linkage analysis has become a crucial part of all disease mapping studies. Paradoxically, multipoint lod scores become increasingly difficult to compute, particularly as the numbers of markers, marker alleles and untyped people increase. We have solved this problem by using a novel set-recording scheme to recode each person's genotype and 'fuzzy inheritance' to infer transmission probabilities. Our approach is implemented in a memory-efficient computer program, VITESSE, for extremely rapid computation of exact multipoint likelihoods. VITESSE enables fast and precise multipoint mapping of disease loci with highly polymorphic markers.

Algorithms↗
PubMed1983

Primary carcinoma of female urethra.

The clinical and morphologic features in 29 cases of primary carcinoma of the female urethra were reviewed. Only 2 of 12 patients treated with radiotherapy are known to have failed; one is dead of disease at one year, and the other is alive with local recurrence at two years. We consider these results sufficiently satisfactory to warrant the continued use of radiotherapy in early-stage lesions, as well as in selected patients who have infiltrating carcinoma. Integrated therapy consisting of 5,000 rad/25 fractions/five weeks, followed in six weeks by radical cystourethrectomy, was used in 7 patients. The low morbidity and absence of operative mortality recommend continuation of this aggressive approach for infiltrating tumors in selected patients.

Adenocarcinoma↗
PubMed1983

Leiomyosarcoma of the penis.

We report a case of an aggressive leiomyosarcoma of the penis treated with radical surgery, radiotherapy and chemotherapy. The patient died 7 months after diagnosis.

Humans↗