( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality.

, , , и . PLoS Comput. Biol., (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.

M Teresa Pisabarro

Teresa Edenfeld

Charakterisierung der Funktion der Proteinkinase D2 als Regulator der Chromogranin-A-Sekretion in humanen BON neuroendokrinen Tumorzellen. Uni Ulm, (2010)

Teresa Schaumann

Teresa Carlomagno

Teresa Halsband

 

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

Parallel Construction of near Optimal binary Trees., и . SPAA, стр. 234-243. ACM, (1990)Graph Theoretical Insights into Evolution of Multidomain Proteins., , , и . RECOMB, том 3500 из Lecture Notes in Computer Science, стр. 311-325. Springer, (2005)Detecting SNP-Induced Structural Changes in RNA: Application to Disease Studies., , , и . RECOMB, том 7262 из Lecture Notes in Computer Science, стр. 241-243. Springer, (2012)AptaCluster - A Method to Cluster HT-SELEX Aptamer Pools and Lessons from Its Application., , , , и . RECOMB, том 8394 из Lecture Notes in Computer Science, стр. 115-128. Springer, (2014)Maximum Agreement Subtree (of 3 or More Trees).. Encyclopedia of Algorithms, Springer, (2008)Interrogating domain-domain interactions with parsimony based approaches., и . BMC Bioinform., (2008)On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs., и . SIAM J. Discret. Math., 3 (2): 281-293 (1990)Maximum Agreement Subtree (of 3 or More Trees).. Encyclopedia of Algorithms, (2016)A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees., и . J. Parallel Distributed Comput., 35 (1): 49-56 (1996)Improving Strand Pairing Prediction through Exploring Folding Cooperativity., , и . IEEE ACM Trans. Comput. Biol. Bioinform., 5 (4): 484-491 (2008)