Mod/Resc parsimony inference: theory and application
DOI10.1016/J.IC.2011.03.008zbMATH Open1237.92041OpenAlexW2092636529MaRDI QIDQ418168FDOQ418168
Authors: Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstädter, Max Reuter, Olivier Duron, Marie-France Sagot 
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.03.008
Recommendations
- Mod/Resc parsimony inference
- Efficient approximation for restricted biclique cover problems
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
- Covering graphs with few complete bipartite subgraphs
- Extended islands of tractability for parsimony haplotyping
graph theorybipartite graphcomputational biologyNP-completenessfixed-parameter tractabilityBoolean matrixbiclique edge coveringkernelisation
Medical epidemiology (92C60) Applications of graph theory (05C90) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Parametrized complexity theory.
- A New Algorithm for Generating All the Maximal Independent Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On covering graphs by complete bipartite subgraphs
- Covering graphs with few complete bipartite subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data reduction and exact algorithms for clique cover
- Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
- Bicliques in graphs. I: Bounds on their number
Cited In (5)
This page was built for publication: Mod/Resc parsimony inference: theory and application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418168)
