SNPs Problems, Complexity, and Algorithms
- 17 August 2001
- book chapter
- Published by Springer Nature
- p. 182-193
- https://doi.org/10.1007/3-540-44676-1_15
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Sequence of the Human GenomeScience, 2001
- Weakly triangulated graphsJournal of Combinatorial Theory, Series B, 1985
- Node-and edge-deletion NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1978
- On the complexity of the Maximum Subgraph ProblemPublished by Association for Computing Machinery (ACM) ,1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976