Skip Navigation


Bioinformatics Advance Access originally published online on July 12, 2005
Bioinformatics 2005 21(17):3565-3567; doi:10.1093/bioinformatics/bti571
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
21/17/3565    most recent
bti571v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (10)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hoffmann, K.
Right arrow Articles by Lindner, T. H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Hoffmann, K.
Right arrow Articles by Lindner, T. H.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

easyLINKAGE-Plus—automated linkage analyses using large-scale SNP data

K. Hoffmann 1 and T. H. Lindner 2,3,*

1Institute of Medical Genetics, Charité, Humboldt University Berlin Augustenburger Platz 1, 13353 Berlin, Germany
2Division of Nephrology, Department of Medicine, Medical University Clinic at the University of Würzburg Josef-Schneider-Strasse 2, 97080 Würzburg, Germany
3Department of Clinical Biochemistry and Pathobiochemistry, Medical University Clinic at the University of Würzburg Versbacher Strasse 5, 97078 Würzburg, Germany

*To whom correspondence should be addressed.

Summary: We extended the original easyLINKAGE program by enabling linkage analyses for large-scale SNP data in addition to those of microsatellites. We implemented new modules for Allegro, Merlin, SimWalk, GeneHunter Imprinting, GeneHunter TwoLocus, SuperLink and extended FastSLink by automatic loop breaking and new outputs. We added conditional linkage analyses as well as multipoint simulation studies, and extended error test routines by checking for Mendelian/non-Mendelian genotyping errors and for deviations from Hardy–Weinberg equilibrium. Data can be analyzed in sets of markers, in defined centimorgan intervals and by using different allele frequency algorithms. The outputs consist of genome-wide as well as chromosomal postscript plots of LOD scores, NPL scores, P-values and other parameters.

Availability: http://www.uni-wuerzburg.de/nephrologie/molecular_genetics/molecular_genetics.htm

Contact: tom.lindner{at}mail.uni-wuerzburg.de

Supplementary information: Supplementary information is available on the website. The current version is v4.01beta.

Received on March 2, 2005; revised on June 15, 2005; accepted on July 3, 2005

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Hum ReprodHome page
R.A. Oldenburg, M.F. van Dooren, B. de Graaf, E. Simons, L. Govaerts, S. Swagemakers, J.M.H. Verkerk, B.A. Oostra, and A.M. Bertoli-Avella
A genome-wide linkage scan in a Dutch family identifies a premature ovarian failure susceptibility locus
Hum. Reprod., August 9, 2008; (2008) den278v1.
[Abstract] [Full Text] [PDF]

Home page
 Arch OphthalmolHome page
A. I. den Hollander, J. J. C. van Lith-Verhoeven, M. L. Arends, T. M. Strom, F. P. M. Cremers, and C. B. Hoyng
Novel Compound Heterozygous TULP1 Mutations in a Family With Severe Early-Onset Retinitis Pigmentosa
Arch Ophthalmol, July 1, 2007; 125(7): 932 - 935.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.