![]() | ![]() |
| 2011 | ||
|---|---|---|
| 66 | Ion I. Mandoiu, Satoru Miyano, Teresa M. Przytycka, Sanguthevar Rajasekaran: IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2011, Orlando, FL, USA, February 3-5, 2011 IEEE Computer Society 2011 | |
| 65 | Teresa M. Przytycka, Marie-France Sagot: Algorithms in Bioinformatics - 11th International Workshop, WABI 2011, Saarbrücken, Germany, September 5-7, 2011. Proceedings Springer 2011 | |
| 64 | Min Wu, Chee Keong Kwoh, Teresa M. Przytycka, Jing Li, Jie Zheng: Prediction of Trans-regulators of Recombination Hotspots in Mouse Genome. BIBM 2011: 57-62 | |
| 63 | Mark Borodovsky, Teresa M. Przytycka, Sanguthevar Rajasekaran, Alexander Zelikovsky: Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 865-866 (2011) | |
| 2010 | ||
| 62 | Mark Borodovsky, Johann Peter Gogarten, Teresa M. Przytycka, Sanguthevar Rajasekaran: Bioinformatics Research and Applications, 6th International Symposium, ISBRA 2010, Storrs, CT, USA, May 23-26, 2010. Proceedings Springer 2010 | |
| 61 | Tanya Y. Berger-Wolf, Teresa M. Przytycka, Mona Singh, Donna K. Slonim: Session Introduction. Pacific Symposium on Biocomputing 2010: 120-122 | |
| 60 | Yoo-Ah Kim, Stefan Wuchty, Teresa M. Przytycka: Simultaneous Identification of Causal Genes and Dys-Regulated Pathways in Complex Diseases. RECOMB 2010: 263-280 | |
| 59 | Saikat Chakrabarti, Christopher J. Lanczycki, Anna R. Panchenko, Teresa M. Przytycka, Paul A. Thiessen, Stephen H. Bryant: State of the art: refinement of multiple sequence alignments. BMC Bioinformatics 11: 3 (2010) | |
| 58 | Jie Zheng, David Zhang, Pawel F. Przytycki, Rafal Zielinski, Jacek Capala, Teresa M. Przytycka: SimBoolNet - a Cytoscape plugin for dynamic simulation of signaling networks. Bioinformatics 26(1): 141-142 (2010) | |
| 57 | Teresa M. Przytycka, Mona Singh, Donna K. Slonim: Toward the dynamic interactome: it's about time. Briefings in Bioinformatics 11(1): 15-29 (2010) | |
| 2009 | ||
| 56 | Katia S. Guimarães, Anna R. Panchenko, Teresa M. Przytycka: Advances in Bioinformatics and Computational Biology, 4th Brazilian Symposium on Bioinformatics, BSB 2009, Porto Alegre, Brazil, July 29-31, 2009. Proceedings Springer 2009 | |
| 55 | Tanya Y. Berger-Wolf, Teresa M. Przytycka, Mona Singh: Session Introduction. Pacific Symposium on Biocomputing 2009: 174-177 | |
| 54 | Yang Huang, Stefan Wuchty, Michael T. Ferdig, Teresa M. Przytycka: Graph theoretical approach to study eQTL: a case study of Plasmodium falciparum. Bioinformatics 25(12): (2009) | |
| 2008 | ||
| 53 | Teresa M. Przytycka: Maximum Agreement Subtree (of 3 or More Trees). Encyclopedia of Algorithms 2008 | |
| 52 | Katia S. Guimarães, Teresa M. Przytycka: Interrogating domain-domain interactions with parsimony based approaches. BMC Bioinformatics 9: (2008) | |
| 51 | Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka: Improving Strand Pairing Prediction through Exploring Folding Cooperativity. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 484-491 (2008) | |
| 50 | Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi: DOMINE: a database of protein domain interactions. Nucleic Acids Research 36(Database-Issue): 656-661 (2008) | |
| 2007 | ||
| 49 | Jie Zheng, Igor B. Rogozin, Eugene V. Koonin, Teresa M. Przytycka: A Rigorous Analysis of the Pattern of Intron Conservation Supports the Coelomata Clade of Animals. RECOMB-CG 2007: 177-191 | |
| 48 | Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka: Bringing Folding Pathways into Strand Pairing Prediction. WABI 2007: 38-48 | |
| 47 | Raja Jothi, Teresa M. Przytycka, L. Aravind: Discovering functional linkages and uncharacterized cellular pathways using phylogenetic profile comparisons: a comprehensive assessment. BMC Bioinformatics 8: (2007) | |
| 46 | Teresa M. Przytycka: Stability of Characters and Construction of Phylogenetic Trees. Journal of Computational Biology 14(5): 539-549 (2007) | |
| 2006 | ||
| 45 | Teresa M. Przytycka: Chordal Graphs in Computational Biology - New Insights and Applications. International Conference on Computational Science (2) 2006: 620-621 | |
| 44 | Teresa M. Przytycka: An Important Connection Between Network Motifs and Parsimony Models. RECOMB 2006: 321-335 | |
| 43 | Elena Zotenko, Katia S. Guimarães, Raja Jothi, Teresa M. Przytycka: Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations. Algorithms for Molecular Biology 1: (2006) | |
| 42 | Saikat Chakrabarti, Christopher J. Lanczycki, Anna R. Panchenko, Teresa M. Przytycka, Paul A. Thiessen, Stephen H. Bryant: State of the art: refinement of multiple sequence alignments. BMC Bioinformatics 7: 499 (2006) | |
| 41 | Raja Jothi, Elena Zotenko, Asba Tasneem, Teresa M. Przytycka: COCO-CL: hierarchical clustering of homology relations based on evolutionary correlations. Bioinformatics 22(7): 779-788 (2006) | |
| 40 | Teresa M. Przytycka, George Davis, Nan Song, Dannie Durand: Graph Theoretical Insights into Evolution of Multidomain Proteins. Journal of Computational Biology 13(2): 351-363 (2006) | |
| 2005 | ||
| 39 | Raja Jothi, Maricel G. Kann, Teresa M. Przytycka: Predicting protein-protein interaction by searching evolutionary tree automorphism space. ISMB (Supplement of Bioinformatics) 2005: 241-250 | |
| 38 | Teresa M. Przytycka, George Davis, Nan Song, Dannie Durand: Graph Theoretical Insights into Evolution of Multidomain Proteins. RECOMB 2005: 311-325 | |
| 37 | Elena Zotenko, Katia S. Guimarães, Raja Jothi, Teresa M. Przytycka: Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations. Systems Biology and Regulatory Genomics 2005: 23-38 | |
| 2004 | ||
| 36 | Teresa M. Przytycka, Yi-Kuo Yu: Scale-free networks versus evolutionary drift. Computational Biology and Chemistry 28(4): 257-264 (2004) | |
| 2000 | ||
| 35 | Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup: An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput. 30(5): 1385-1404 (2000) | |
| 1999 | ||
| 34 | S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom: On an Optimal Split Tree Problem. WADS 1999: 157-168 | |
| 1998 | ||
| 33 | Lawrence L. Larmore, Teresa M. Przytycka: The Optimal Alphabetic Tree Problem Revisited. J. Algorithms 28(1): 1-20 (1998) | |
| 32 | Lisa Higham, Teresa M. Przytycka: Asymptotically Optimal Election on Weighted Rings. SIAM J. Comput. 28(2): 720-732 (1998) | |
| 1997 | ||
| 31 | Ming-Yang Kao, Tak Wah Lam, Teresa M. Przytycka, Wing-Kin Sung, Hing-Fung Ting: General Techniques for Comparing Unrooted Evolutionary Trees. STOC 1997: 54-65 | |
| 30 | Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka: Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. Algorithmica 17(1): 67-87 (1997) | |
| 29 | Teresa M. Przytycka, Józef H. Przytycki: A simple construction of high representativity triangulations. Discrete Mathematics 173(1-3): 209-228 (1997) | |
| 1996 | ||
| 28 | Mike Paterson, Teresa M. Przytycka: On the Complexity of String Folding. ICALP 1996: 658-669 | |
| 27 | Teresa M. Przytycka, Lisa Higham: Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. SWAT 1996: 246-258 | |
| 26 | David G. Kirkpatrick, Teresa M. Przytycka: Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt. Algorithmica 15(2): 172-192 (1996) | |
| 25 | Mike Paterson, Teresa M. Przytycka: On the Complexity of String Folding. Discrete Applied Mathematics 71(1-3): 217-230 (1996) | |
| 24 | Lisa Higham, Teresa M. Przytycka: A Simple, Efficient Algorithm for Maximum Finding on Rings. Inf. Process. Lett. 58(6): 319-324 (1996) | |
| 23 | Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka: Parallel Maximum Independent Set in Convex Bipartite Graphs. Inf. Process. Lett. 59(6): 289-294 (1996) | |
| 22 | Lawrence L. Larmore, Teresa M. Przytycka: A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. J. Parallel Distrib. Comput. 35(1): 49-56 (1996) | |
| 1995 | ||
| 21 | Martin Farach, Teresa M. Przytycka, Mikkel Thorup: Computing the Agreement of Trees with Bounded Degrees. ESA 1995: 381-393 | |
| 20 | Jan Kratochvíl, Teresa M. Przytycka: Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract). Graph Drawing 1995: 365-372 | |
| 19 | Martin Farach, Teresa M. Przytycka, Mikkel Thorup: On the Agreement of Many Trees. Inf. Process. Lett. 55(6): 297-301 (1995) | |
| 18 | Lawrence L. Larmore, Teresa M. Przytycka: Constructing Huffman Trees in Parallel. SIAM J. Comput. 24(6): 1163-1169 (1995) | |
| 1994 | ||
| 17 | Teresa M. Przytycka, Lawrence L. Larmore: The Optimal Alphabetic Tree Problem Revisited. ICALP 1994: 251-262 | |
| 16 | Lisa Higham, Teresa M. Przytycka: Asymptotically Optimal Election on Weighted Rings. SWAT 1994: 207-218 | |
| 15 | Christos Levcopoulos, Teresa M. Przytycka: A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. Parallel Processing Letters 4: 37-43 (1994) | |
| 14 | Lawrence L. Larmore, Teresa M. Przytycka: A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. SIAM J. Comput. 23(6): 1283-1312 (1994) | |
| 1993 | ||
| 13 | Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter: Parallel Construction of Optimal Alphabetic Trees. SPAA 1993: 214-223 | |
| 12 | Lisa Higham, Teresa M. Przytycka: A Simple, Efficient Algorithm for Maximum Finding on Rings. WDAG 1993: 249-263 | |
| 11 | S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides: Grid intersection graphs and boxicity. Discrete Mathematics 114(1-3): 41-49 (1993) | |
| 1992 | ||
| 10 | Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka: Optimal Tree Ranking is in NC. Parallel Processing Letters 2: 31-41 (1992) | |
| 1991 | ||
| 9 | Teresa M. Przytycka, Józef H. Przytycki: Surface triangulations without short noncontractible cycles. Graph Structure Theory 1991: 303-340 | |
| 8 | Teresa M. Przytycka, Józef H. Przytycki: Subexponentially computable truncations of Jones-types polynomials. Graph Structure Theory 1991: 63-108 | |
| 7 | Lawrence L. Larmore, Teresa M. Przytycka: Parallel Construction of Trees with Optimal Weighted Path Length. SPAA 1991: 71-80 | |
| 6 | Teresa M. Przytycka, Derek G. Corneil: Parallel Algorithms for Parity Graphs. J. Algorithms 12(1): 96-109 (1991) | |
| 1990 | ||
| 5 | David G. Kirkpatrick, Teresa M. Przytycka: Parallel Construction of near Optimal binary Trees. SPAA 1990: 234-243 | |
| 4 | David G. Kirkpatrick, Teresa M. Przytycka: An optimal parallel minimax tree algorithm. SPDP 1990: 293-300 | |
| 3 | David G. Kirkpatrick, Teresa M. Przytycka: Parallel recognition of complement reducible graphs and cotree construction. Discrete Applied Mathematics 29(1): 79-96 (1990) | |
| 2 | Teresa M. Przytycka, Józef H. Przytycki: On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs. SIAM J. Discrete Math. 3(2): 281-293 (1990) | |
| 1989 | ||
| 1 | Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka: A Simple Parallel Tree Contraction Algorithm. J. Algorithms 10(2): 287-302 (1989) | |
Colors in the list of coauthors
Last update Tue Feb 14 23:09:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page