From post

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.

, , , , , и . APBC, том 6 из Advances in Bioinformatics and Computational Biology, стр. 333-342. Imperial College Press, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

The complexity of zero-visibility cops and robber., , , и . Theor. Comput. Sci., (2015)One-visibility cops and robber on trees., и . Theor. Comput. Sci., (2021)Constrained Graph Searching on Trees., , и . IJTCS-FAW, том 13933 из Lecture Notes in Computer Science, стр. 239-251. Springer, (2023)On the Computation and Chromatic Number of Colored Domino Tilings., и . CCCG, стр. 203-206. (2005)Minimal Tetrahedralizations of a Class of Polyhedra., и . CCCG, (2000)Fast Edge-Searching and Related Problems.. COCOA (2), том 6509 из Lecture Notes in Computer Science, стр. 228-242. Springer, (2010)Standard directed search strategies and their applications., и . J. Comb. Optim., 17 (4): 378-399 (2009)Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem., , , и . COCOA, том 6831 из Lecture Notes in Computer Science, стр. 299-310. Springer, (2011)Lower Bounds on Fast Searching., и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 964-973. Springer, (2009)Lower bounds for positive semidefinite zero forcing and their applications.. J. Comb. Optim., 33 (1): 81-105 (2017)