| 2012 | ||
|---|---|---|
| j33 | Derek Aguiar, Bjarni V. Halldórsson, Eric M. Morrow, Sorin Istrail: DELISHUS: an efficient and exact algorithm for genome-wide detection of deletion polymorphism in autism. Bioinformatics 28(12): 154-162 (2012) | |
| j32 | Derek Aguiar, Sorin Istrail: HapCompass: A Fast Cycle Basis Algorithm for Accurate Haplotype Assembly of Sequence Data. Journal of Computational Biology 19(6): 577-590 (2012) | |
| c37 | Hagit Shatkay, Ramya Narayanaswamy, Santosh S. Nagaral, Na Harrington, M. V. Rohith, Gowri Somanath, Ryan Tarpine, Kyle Schutter, Tim Johnstone, Dorothea Blostein, Sorin Istrail, Chandra Kambhamettu: OCR-based image features for biomedical image and article classification: identifying documents relevant to cis-regulatory elements. BCB 2012: 98-104 | |
| c36 | Derek Aguiar, Sorin Istrail: Workshop: Robust algorithms for inferring haplotype phase and deletion polymorphism from high-throughput whole genome sequence data. ICCABS 2012: 1 | |
| c35 | Sorin Istrail, Solomon Marcus: Alan Turing and John von Neumann - Their Brains and Their Computers. Int. Conf. on Membrane Computing 2012: 26-35 | |
| e5 | Sorin Istrail, Ion I. Mandoiu, Mihai Pop, Sanguthevar Rajasekaran, John L. Spouge (Eds.): IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2012, Las Vegas, NV, USA, February 23-25, 2012. IEEE 2012, isbn 978-1-4673-1320-9 | |
| 2011 | ||
| j31 | Bjarni V. Halldórsson, Derek Aguiar, Ryan Tarpine, Sorin Istrail: The Clark Phaseable Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS. Journal of Computational Biology 18(3): 323-333 (2011) | |
| c34 | Austin Huang, Rami Kantor, Allison DeLong, Leeann Schreier, Sorin Istrail: QColors: An algorithm for conservative viral quasispecies reconstruction from short and non-contiguous next generation sequencing reads. BIBM Workshops 2011: 130-136 | |
| c33 | Bjarni V. Halldórsson, Derek Aguiar, Sorin Istrail: Haplotype Phasing By Multi-Assembly of Shared Haplotypes: Phase-Dependent Interactions Between Rare Variants. Pacific Symposium on Biocomputing 2011: 88-99 | |
| c32 | Ryan Tarpine, Fumei Lam, Sorin Istrail: Conservative Extensions of Linkage Disequilibrium Measures from Pairwise to Multi-loci and Algorithms for Optimal Tagging SNP Selection. RECOMB 2011: 468-482 | |
| 2010 | ||
| j30 | Fumei Lam, Ryan Tarpine, Sorin Istrail: The Imperfect Ancestral Recombination Graph Reconstruction Problem: Upper Bounds for Recombination and Homoplasy. Journal of Computational Biology 17(6): 767-781 (2010) | |
| c31 | Bjarni V. Halldórsson, Derek Aguiar, Ryan Tarpine, Sorin Istrail: The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS. RECOMB 2010: 158-173 | |
| 2007 | ||
| j29 | Sorin Istrail, Pavel A. Pevzner, Ron Shamir: Preface. Discrete Applied Mathematics 155(6-7): 673-674 (2007) | |
| 2006 | ||
| j28 | Roded Sharan, Bjarni V. Halldórsson, Sorin Istrail: Islands of Tractability for Parsimony Haplotyping. IEEE/ACM Trans. Comput. Biology Bioinform. 3(3): 303-311 (2006) | |
| e4 | Alberto Apostolico, Concettina Guerra, Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman (Eds.): Research in Computational Molecular Biology, 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings. Lecture Notes in Computer Science 3909, Springer 2006, isbn 3-540-33295-2 | |
| 2005 | ||
| j27 | Ross A. Lippert, Xiaoyue Zhao, Liliana Florea, Clark M. Mobarry, Sorin Istrail: Finding Anchors for Genomic Sequence Comparison. Journal of Computational Biology 12(6): 762-776 (2005) | |
| j26 | Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi: Polynomial and APX-hard cases of the individual haplotyping problem. Theor. Comput. Sci. 335(1): 109-125 (2005) | |
| c30 | Roded Sharan, Bjarni V. Halldórsson, Sorin Istrail: Islands of Tractability for Parsimony Haplotyping. CSB 2005: 65-72 | |
| c29 | ||
| e3 | Satoru Miyano, Jill P. Mesirov, Simon Kasif, Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman (Eds.): Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings. Lecture Notes in Computer Science 3500, Springer 2005, isbn 3-540-25866-3 | |
| 2004 | ||
| j25 | Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz: 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. Journal of Computational Biology 11(1): 27-52 (2004) | |
| c28 | Ross Lippert, Xiaoyue Zhao, Liliana Florea, Clark M. Mobarry, Sorin Istrail: Finding anchors for genomic sequence comparison. RECOMB 2004: 233-241 | |
| e2 | Sorin Istrail, Michael S. Waterman, Andrew G. Clark (Eds.): Computational Methods for SNPs and Haplotype Inference, DIMACS/RECOMB Satellite Workshop, Piscataway, NJ, USA, November 21-22, 2002, Revised Papers. Lecture Notes in Computer Science 2983, Springer 2004, isbn 3-540-21249-3 | |
| 2003 | ||
| j24 | Russell Schwartz, Bjarni V. Halldórsson, Vineet Bafna, Andrew G. Clark, Sorin Istrail: Robustness of Inference of Haplotype Block Structure. Journal of Computational Biology 10(1): 13-19 (2003) | |
| c27 | Liliana Florea, Bjarni V. Halldórsson, Oliver Kohlbacher, Russell Schwartz, Stephen Hoffman, Sorin Istrail: Epitope Prediction Algorithms for Peptide based Vaccine Design. CSB 2003: 17-26 | |
| c26 | Bjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail: Combinatorial Problems Arising in SNP and Haplotype Analysis. DMTCS 2003: 26-47 | |
| c25 | ||
| c24 | Giuseppe Lancia, Sorin Istrail: Protein Structure Comparison: Algorithms and Applications. Mathematical Methods for Protein Structure Analysis and Design 2003: 1-33 | |
| c23 | Vineet Bafna, Bjarni V. Halldórsson, Russell Schwartz, Andrew G. Clark, Sorin Istrail: Haplotypes and informative SNP selection algorithms: don't block out information. RECOMB 2003: 19-27 | |
| e1 | Concettina Guerra, Sorin Istrail (Eds.): Mathematical Methods for Protein Structure Analysis and Design, Advanced Lectures. Lecture Notes in Computer Science 2666, Springer 2003, isbn 3-540-40104-0 | |
| 2002 | ||
| j23 | Ross Lippert, Russell Schwartz, Giuseppe Lancia, Sorin Istrail: Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings in Bioinformatics 3(1): 23-31 (2002) | |
| c22 | Bjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail: A Survey of Computational Methods for Determining Haplotypes. Computational Methods for SNPs and Haplotype Inference 2002: 26-47 | |
| c21 | Russell Schwartz, Andrew G. Clark, Sorin Istrail: Inferring Piecewise Ancestral History from Haploid Sequences. Computational Methods for SNPs and Haplotype Inference 2002: 62-73 | |
| c20 | Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia: Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. WABI 2002: 29-43 | |
| c19 | Russell Schwartz, Andrew G. Clark, Sorin Istrail: Methods for Inferring Block-Wise Ancestral History from Haploid Sequences. WABI 2002: 44-59 | |
| 2001 | ||
| c18 | Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz: SNPs Problems, Complexity, and Algorithms. ESA 2001: 182-193 | |
| c17 | Russell J. Turner, Kabir Chaturvedi, Nathan Edwards, Daniel P. Fasulo, Aaron L. Halpern, Daniel H. Huson, Oliver Kohlbacher, Jason R. Miller, Knut Reinert, Karin A. Remington, Russell Schwartz, Brian Walenz, Shibu Yooseph, Sorin Istrail: Visualization challenges for a new cyberpharmaceutical computing paradigm. IEEE Symposium on Parallel and Large-Data Visualization and Graphics 2001: 7-18 | |
| c16 | Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail: 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. RECOMB 2001: 193-202 | |
| 2000 | ||
| j22 | Sorin Istrail, Pavel A. Pevzner, Ron Shamir: Foreword. Discrete Applied Mathematics 104(1-3): 1-2 (2000) | |
| j21 | William E. Hart, Sorin Istrail: Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms. J. UCS 6(6): 560-579 (2000) | |
| c15 | Deborah Goldman, Sorin Istrail, Giuseppe Lancia, Antonio Piccolboni, Brian Walenz: Algorithmic strategies in combinatorial chemistry. SODA 2000: 275-284 | |
| c14 | Sorin Istrail: Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract). STOC 2000: 87-96 | |
| 1999 | ||
| j20 | Sorin Istrail, Russell Schwartz, Jonathan A. King: Lattice Simulations of Aggregation Funnels for Protein Folding. Journal of Computational Biology 6(2): 143-162 (1999) | |
| j19 | Sorin Istrail: Preface: Special RECOMB'99 Issue. Journal of Computational Biology 6(3/4): 279 (1999) | |
| c13 | Serafim Batzoglou, Sorin Istrail: Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem. CPM 1999: 66-77 | |
| c12 | Deborah Goldman, Sorin Istrail, Christos H. Papadimitriou: Algorithmic Aspects of Protein Structure Similarity. FOCS 1999: 512-522 | |
| 1998 | ||
| j18 | Sorin Istrail, Pavel A. Pevzner, Ron Shamir: Foreword. Discrete Applied Mathematics 88(1-3): 3-6 (1998) | |
| 1997 | ||
| j17 | William E. Hart, Sorin Istrail: Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials. Journal of Computational Biology 4(1): 1-22 (1997) | |
| j16 | Michael S. Waterman, Sorin Istrail, Pavel A. Pevzner: Selected Papers from RECOMB'97 - Preface. Journal of Computational Biology 4(3): 215-216 (1997) | |
| j15 | William E. Hart, Sorin Istrail: Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal. Journal of Computational Biology 4(3): 241-259 (1997) | |
| c11 | William E. Hart, Sorin Istrail: Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal. RECOMB 1997: 137-146 | |
| 1996 | ||
| j14 | William E. Hart, Sorin Istrail: Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal. Journal of Computational Biology 3(1): 53-96 (1996) | |
| c10 | William E. Hart, Sorin Istrail: Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract). CPM 1996: 288-303 | |
| 1995 | ||
| j13 | Bard Bloom, Sorin Istrail, Albert R. Meyer: Bisimulation Can't be Traced. J. ACM 42(1): 232-268 (1995) | |
| j12 | David S. Greenberg, Sorin Istrail: Physical Mapping by STS Hybridization: Algorithmic Strategies and the Challenge of Software Evaluation. Journal of Computational Biology 2(2): 219-273 (1995) | |
| c9 | William E. Hart, Sorin Istrail: Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract). STOC 1995: 157-168 | |
| 1994 | ||
| j11 | David S. Greenberg, Sorin Istrail: The Chimeric Mapping Problem: Algorithmic Strategies and Performance Evaluation on Synthetic Genomic Data. Computers & Chemistry 18(3): 207-220 (1994) | |
| j10 | Sorin Istrail, Dejan Zivkovic: Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC^0. Inf. Process. Lett. 50(4): 211-216 (1994) | |
| 1993 | ||
| c8 | Sorin Istrail, Dejan Zivkovic: A Non-Probabilistic Switching Lemma for the Sipser Function. STACS 1993: 566-575 | |
| 1992 | ||
| j9 | Lenwood S. Heath, Sorin Istrail: The Pagenumber of Genus g Graphs is O(g). J. ACM 39(3): 479-501 (1992) | |
| 1990 | ||
| c7 | Sorin Istrail: Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract). FOCS 1990: 439-448 | |
| 1989 | ||
| j8 | Sorin Istrail: An Arithmetical Hierarchy in Propositional Dynamic Logic. Inf. Comput. 81(3): 280-289 (1989) | |
| 1988 | ||
| c6 | ||
| c5 | Sorin Istrail: Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract). STOC 1988: 491-503 | |
| 1987 | ||
| c4 | ||
| 1983 | ||
| j7 | Sorin Istrail, Cristian Masalagiu: Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization. Theor. Comput. Sci. 26: 83-103 (1983) | |
| c3 | Sorin Istrail, Cristian Masalagiu: Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization. CAAP 1983: 255-268 | |
| 1982 | ||
| j6 | Sorin Istrail: Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages. Theor. Comput. Sci. 18: 333-341 (1982) | |
| j5 | ||
| 1981 | ||
| c2 | Sorin Istrail: Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types. ICALP 1981: 333-347 | |
| 1979 | ||
| j4 | Sorin Istrail: On Complements of Some Bounded Context-Sensitive Languages. Information and Control 42(3): 283-289 (1979) | |
| c1 | Sorin Istrail: A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs. ICALP 1979: 289-303 | |
| 1978 | ||
| j3 | ||
| j2 | Sorin Istrail: Tag Systems Generating Thue Irreducible Sequences. Inf. Process. Lett. 7(3): 129-131 (1978) | |
| j1 | ||
Colors in the list of coauthors
Last update Sun May 26 07:26:05 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page