( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
DePIE: Designing Primers for Protein Interaction Experiments.

, , , и . Nucleic Acids Res., 31 (13): 3755-3757 (2003)

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.

Mark Hallett

William Hallett

Michael R T Macnair

T Neumann

T Attin

 

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

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard., , , , , и . J. Bioinform. Comput. Biol., 2 (2): 257-272 (2004)Refining Protein Subcellular Localization., , , и . PLoS Comput. Biol., (2005)Hunting for Functionally Analogous Genes., и . FSTTCS, том 1974 из Lecture Notes in Computer Science, стр. 465-476. Springer, (2000)Reproducible Data Analysis Pipelines for Precision Medicine., , , и . PDP, стр. 299-306. IEEE, (2019)On the Parameterized Complexity of Layered Graph Drawing., , , , , , , , , и 2 other автор(ы). ESA, том 2161 из Lecture Notes in Computer Science, стр. 488-499. Springer, (2001)A compendium of parameterized complexity results., и . SIGACT News, 25 (3): 122-123 (1994)A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data., и . IEEE ACM Trans. Comput. Biol. Bioinform., 7 (1): 118-125 (2010)The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs., , , , и . Theor. Comput. Sci., 244 (1-2): 167-188 (2000)Darwin v. 2.0: an interpreted computer language for the biosciences., , , и . Bioinform., 16 (2): 101-103 (2000)Analogs and Duals of the MAST Problem for Sequences and Trees., , , и . ESA, том 1461 из Lecture Notes in Computer Science, стр. 103-114. Springer, (1998)