Parameterizing MAX SNP Problems Above Guaranteed Values
type: Item
instance of: scholarly article
title: Parameterizing MAX SNP Problems Above Guaranteed Values
zbMATH Open document ID: 1154.68430
DOI: 10.1007/11847250_4
author: Meena Mahajan
author: Venkatesh Raman
author: Somnath Sikdar
published in: Parameterized and Exact Computation
publication date: 2008-06-03T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5282003
MaRDI profile type: Publication
full work available at URL: 11847250 4
OpenAlex ID: W1675014040
Recommended article: Q4796705
Recommended article: Q4408101
Recommended article: Maximum bounded \(H\)-matching is Max SNP-complete
Recommended article: Q4452087
Recommended article: Parameterizing above Guaranteed Values: MaxSat and MaxCut
Recommended article: The complexity of the single individual SNP haplotyping problem
Recommended article: Efficient Algorithms for SNP Haplotype Block Selection Problems
Recommended article: Maximizing a Family of Optimal Statistics over a Nuisance Parameter with Applications to Genetic Data Analysis
Recommended article: Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees
Recommended article: Some MAX SNP-hard results concerning unordered labeled trees
description: scientific article