( en | de | ru )

 

Disambiguation of "Przytycka, Teresa M."

Author of the publication

copydeleteadd this publication to your clipboard
AptaTRACE: Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments.

, , , , , , , , , and . RECOMB, volume 9649 of Lecture Notes in Computer Science, page 261-262. Springer, (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

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 Gaillard

Teresa Linares

Teresa Krauskopf

 

Other publications of authors with the same name

Parallel Construction of near Optimal binary Trees., and . SPAA, page 234-243. ACM, (1990)AptaCluster - A Method to Cluster HT-SELEX Aptamer Pools and Lessons from Its Application., , , , and . RECOMB, volume 8394 of Lecture Notes in Computer Science, page 115-128. Springer, (2014)Detecting SNP-Induced Structural Changes in RNA: Application to Disease Studies., , , and . RECOMB, volume 7262 of Lecture Notes in Computer Science, page 241-243. Springer, (2012)Graph Theoretical Insights into Evolution of Multidomain Proteins., , , and . RECOMB, volume 3500 of Lecture Notes in Computer Science, page 311-325. Springer, (2005)Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt., and . Algorithmica, 15 (2): 172-192 (1996)A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees., and . J. Parallel Distributed Comput., 35 (1): 49-56 (1996)Interrogating domain-domain interactions with parsimony based approaches., and . BMC Bioinform., (2008)Reconstruction of Gene Regulatory Networks by Integrating Biological Model and a Recommendation System., , , , , and . RECOMB, volume 12074 of Lecture Notes in Computer Science, page 274-275. Springer, (2020)The Optimal Alphabetic Tree Problem Revisited., and . J. Algorithms, 28 (1): 1-20 (1998)Subexponentially computable truncations of Jones-types polynomials., and . Graph Structure Theory, volume 147 of Contemporary Mathematics, page 63-108. American Mathematical Society, (1991)