Teresa M. Przytycka

According to our database1, Teresa M. Przytycka authored at least 86 papers between 1989 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Accurate Sub-population Detection and Mapping Across Single Cell Experiments with PopCorn.
Proceedings of the Research in Computational Molecular Biology, 2019

A Sticky Multinomial Mixture Model of Strand-Coordinated Mutational Processes in Cancer.
Proceedings of the Research in Computational Molecular Biology, 2019

2018
Detecting presence of mutational signatures in cancer with confidence.
Bioinformatics, 2018

AptaBlocks: Accelerating the Design of RNA-Based Drug Delivery Systems.
Proceedings of the Research in Computational Molecular Biology, 2018

2017
BeWith: A Between-Within method to discover relationships between cancer modules via integrated analysis of mutual exclusivity, co-occurrence and functional interactions.
PLoS Computational Biology, 2017

WeSME: uncovering mutual exclusivity of cancer drivers and beyond.
Bioinformatics, 2017

NetREX: Network Rewiring Using EXpression - Towards Context Specific Regulatory Networks.
Proceedings of the Research in Computational Molecular Biology, 2017

BeWith: A Between-Within Method for Module Discovery in Cancer using Integrated Analysis of Mutual Exclusivity, Co-occurrence and Functional Interactions (Extended Abstract).
Proceedings of the Research in Computational Molecular Biology, 2017

2016
Maximum Agreement Subtree (of 3 or More Trees).
Encyclopedia of Algorithms, 2016

Understanding Genotype-Phenotype Effects in Cancer via Network Approaches.
PLoS Computational Biology, 2016

Ups and Downs of Poised RNA Polymerase II in B-Cells.
PLoS Computational Biology, 2016

Preface.
Journal of Computational Biology, 2016

Generalized logical model based on network topology to capture the dynamical trends of cellular signaling pathways.
BMC Systems Biology, 2016

ISMB 2016 Proceedings.
Bioinformatics, 2016

AptaTRACE: Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments.
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

WeSME: Uncovering Mutual Exclusivity of Cancer Mutations.
Proceedings of the 7th ACM International Conference on Bioinformatics, 2016

2015
MEMCover: integrated analysis of mutual exclusivity and functional network reveals dysregulated pathways across multiple cancer types.
Bioinformatics, 2015

2014
LDsplit: screening for cis-regulatory motifs stimulating meiotic recombination hotspots by analysis of DNA sequence polymorphisms.
BMC Bioinformatics, 2014

AptaCluster - A Method to Cluster HT-SELEX Aptamer Pools and Lessons from Its Application.
Proceedings of the Research in Computational Molecular Biology, 2014

2013
Dissecting Cancer Heterogeneity with a Probabilistic Genotype-Phenotype Model.
Proceedings of the Research in Computational Molecular Biology, 2013

Module Cover - A New Approach to Genotype-Phenotype Studies.
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013

Modeling cell heterogeneity: from single-cell variations to mixed cells populations.
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013

2012
Teasing Apart Translational and Transcriptional Components of Stochastic Variations in Eukaryotic Gene Expression.
PLoS Computational Biology, 2012

Chapter 5: Network Biology Approach to Complex Diseases.
PLoS Computational Biology, 2012

Identification of sequence-structure RNA binding motifs for SELEX-derived aptamers.
Bioinformatics, 2012

Detecting SNP-Induced Structural Changes in RNA: Application to Disease Studies.
Proceedings of the Research in Computational Molecular Biology, 2012

Integration of genomic and epigenomic features to predict meiotic recombination hotspots in human and mouse.
Proceedings of the ACM International Conference on Bioinformatics, 2012

2011
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Identifying Causal Genes and Dysregulated Pathways in Complex Diseases.
PLoS Computational Biology, 2011

Prediction of Trans-regulators of Recombination Hotspots in Mouse Genome.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010
State of the art: refinement of multiple sequence alignments.
BMC Bioinformatics, 2010

SimBoolNet - a Cytoscape plugin for dynamic simulation of signaling networks.
Bioinformatics, 2010

Toward the dynamic interactome: it's about time.
Briefings in Bioinformatics, 2010

Simultaneous Identification of Causal Genes and Dys-Regulated Pathways in Complex Diseases.
Proceedings of the Research in Computational Molecular Biology, 2010

Session Introduction.
Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010

2009
The crosstalk between EGF, IGF, and Insulin cell signaling pathways - computational and experimental analysis.
BMC Systems Biology, 2009

Graph theoretical approach to study eQTL: a case study of Plasmodium falciparum.
Bioinformatics, 2009

Session Introduction.
Proceedings of the Biocomputing 2009: Proceedings of the Pacific Symposium, 2009

2008
Maximum Agreement Subtree (of 3 or More Trees).
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Improving Strand Pairing Prediction through Exploring Folding Cooperativity.
IEEE/ACM Trans. Comput. Biology Bioinform., 2008

Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality.
PLoS Computational Biology, 2008

DOMINE: a database of protein domain interactions.
Nucleic Acids Research, 2008

Interrogating domain-domain interactions with parsimony based approaches.
BMC Bioinformatics, 2008

2007
Stability of Characters and Construction of Phylogenetic Trees.
Journal of Computational Biology, 2007

Discovering functional linkages and uncharacterized cellular pathways using phylogenetic profile comparisons: a comprehensive assessment.
BMC Bioinformatics, 2007

Bringing Folding Pathways into Strand Pairing Prediction.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

A Rigorous Analysis of the Pattern of Intron Conservation Supports the Coelomata Clade of Animals.
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

2006
Graph Theoretical Insights into Evolution of Multidomain Proteins.
Journal of Computational Biology, 2006

COCO-CL: hierarchical clustering of homology relations based on evolutionary correlations.
Bioinformatics, 2006

Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations.
Algorithms for Molecular Biology, 2006

An Important Connection Between Network Motifs and Parsimony Models.
Proceedings of the Research in Computational Molecular Biology, 2006

Chordal Graphs in Computational Biology - New Insights and Applications.
Proceedings of the Computational Science, 2006

2005
Predicting protein-protein interaction by searching evolutionary tree automorphism space.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2004
Scale-free networks versus evolutionary drift.
Computational Biology and Chemistry, 2004

2000
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.
SIAM J. Comput., 2000

1999
On an Optimal Split Tree Problem.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Asymptotically Optimal Election on Weighted Rings.
SIAM J. Comput., 1998

The Optimal Alphabetic Tree Problem Revisited.
J. Algorithms, 1998

1997
A simple construction of high representativity triangulations.
Discrete Mathematics, 1997

Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
Algorithmica, 1997

General Techniques for Comparing Unrooted Evolutionary Trees.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees.
J. Parallel Distrib. Comput., 1996

A Simple, Efficient Algorithm for Maximum Finding on Rings.
Inf. Process. Lett., 1996

Parallel Maximum Independent Set in Convex Bipartite Graphs.
Inf. Process. Lett., 1996

On the Complexity of String Folding.
Discrete Applied Mathematics, 1996

Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt.
Algorithmica, 1996

Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm.
Proceedings of the Algorithm Theory, 1996

Sparse dynamic programming for maximum agreement subtree problem.
Proceedings of the Mathematical Hierarchies and Biology, 1996

1995
Constructing Huffman Trees in Parallel.
SIAM J. Comput., 1995

On the Agreement of Many Trees.
Inf. Process. Lett., 1995

Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract).
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Computing the Agreement of Trees with Bounded Degrees.
Proceedings of the Algorithms, 1995

1994
A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees.
SIAM J. Comput., 1994

A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem.
Parallel Processing Letters, 1994

1993
Grid intersection graphs and boxicity.
Discrete Mathematics, 1993

Parallel Construction of Optimal Alphabetic Trees.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992
Optimal Tree Ranking is in NC.
Parallel Processing Letters, 1992

1991
Parallel Algorithms for Parity Graphs.
J. Algorithms, 1991

Parallel Construction of Trees with Optimal Weighted Path Length.
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Surface triangulations without short noncontractible cycles.
Proceedings of the Graph Structure Theory, 1991

Subexponentially computable truncations of Jones-types polynomials.
Proceedings of the Graph Structure Theory, 1991

1990
On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs.
SIAM J. Discrete Math., 1990

Parallel recognition of complement reducible graphs and cotree construction.
Discrete Applied Mathematics, 1990

An optimal parallel minimax tree algorithm.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Parallel Construction of near Optimal binary Trees.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1989
A Simple Parallel Tree Contraction Algorithm.
J. Algorithms, 1989


  Loading...