On Parsimony Haplotyping
作者： Ferdinando Cicalese , Martin Milanivc
DOI:
关键词: Computational biology 、 Haplotype 、 Computer science
摘要: We present some structural and algorithmic results related to the parsimony haplotyping problem.
uni-bielefeld.de 参考文章(8)
Dirk Strothmann, Stefan Kurtz, Stefan A. Graf, Gerhard Steger, The Syntax and Semantics of a Language for Describing Complex Patterns in Biological Sequences ,(2007)
Sebastian Böcker, Matthias C. Letzel, Zsuzsanna Lipták, Anton Pervukhin, Decomposing Metabolomic Isotope Patterns Lecture Notes in Computer Science. ,vol. 4175, pp. 12- 23 ,(2006) , 10.1007/11851561_2
Ferdinando Cicalese, José Augusto Amgarten Quitzau, 2-stage fault tolerant interval group testing international symposium on algorithms and computation. pp. 858- 868 ,(2007) , 10.1007/978-3-540-77120-3_74
Neil Robertson, P.D Seymour, Graph minors. V. Excluding a planar graph Journal of Combinatorial Theory, Series B. ,vol. 41, pp. 92- 114 ,(1986) , 10.1016/0095-8956(86)90030-4
R. Sharan, B.V. Halldorsson, S. Istrail, Islands of Tractability for Parsimony Haplotyping IEEE/ACM Transactions on Computational Biology and Bioinformatics. ,vol. 3, pp. 303- 311 ,(2006) , 10.1109/TCBB.2006.40
Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, Isao Shirakawa, A New Algorithm for Generating All the Maximal Independent Sets SIAM Journal on Computing. ,vol. 6, pp. 505- 517 ,(1977) , 10.1137/0206036
Frank Zöllner, Gerhard Sagerer, Steffen Neumann, Kerstin Koch, Side chain flexibility for 1:n protein-protein docking ,(2002)
Reinhard Diestel, Graph Theory ,(1997)