Polynomial and APX-hard cases of the individual haplotyping problem

descriptionPublicationkeyboard_double_arrow_right Article 01 May 2005 Italy English Publisher:Elsevier BVJournal:Theoretical Computer Science, volume 335, pages 109-125 (issn: 0304-3975,

Copyright policy )

Authors: Vineet Bafna; Sorin Istrail; Giuseppe Lancia; Romeo Rizzi;

doi: 10.1016/j.tcs.2004.12.017

handle: 11562/409565 , 11390/858998

Polynomial and APX-hard cases of the individual haplotyping problem

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country

Italy

Related Organizations

University of California, San Diego
United States
National Institute for Nuclear Physics
Italy
University of California, San Diego
United States
University of Trento
Italy
University of Udine
Italy

View all View all

Keywords

General Computer Science, Analysis of algorithms and problem complexity, Haplotyping, SNP; haplotyping; dynamic programming, Theoretical Computer Science, APX-hardness, Fixed-parameter tractability, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Genetics and epigenetics, Computer Science(all)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	42
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%