| 2007 |
|---|
| 63 | EE | Sorin Istrail,
Pavel A. Pevzner,
Ron Shamir:
Preface.
Discrete Applied Mathematics 155(6-7): 673-674 (2007) |
| 2006 |
|---|
| 62 | | Alberto Apostolico,
Concettina Guerra,
Sorin Istrail,
Pavel A. Pevzner,
Michael S. Waterman:
Research in Computational Molecular Biology, 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings
Springer 2006 |
| 61 | EE | 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) |
| 2005 |
|---|
| 60 | | Satoru Miyano,
Jill P. Mesirov,
Simon Kasif,
Sorin Istrail,
Pavel A. Pevzner,
Michael S. Waterman:
Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings
Springer 2005 |
| 59 | EE | Roded Sharan,
Bjarni V. Halldórsson,
Sorin Istrail:
Islands of Tractability for Parsimony Haplotyping.
CSB 2005: 65-72 |
| 58 | EE | Eric H. Davidson,
Sorin Istrail:
Logic Functions of the Genomic Cis-regulatory Code.
UC 2005: 19-19 |
| 57 | EE | 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) |
| 56 | EE | 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) |
| 2004 |
|---|
| 55 | | Sorin Istrail,
Michael S. Waterman,
Andrew G. Clark:
Computational Methods for SNPs and Haplotype Inference, DIMACS/RECOMB Satellite Workshop, Piscataway, NJ, USA, November 21-22, 2002, Revised Papers
Springer 2004 |
| 54 | EE | Ross Lippert,
Xiaoyue Zhao,
Liliana Florea,
Clark M. Mobarry,
Sorin Istrail:
Finding anchors for genomic sequence comparison.
RECOMB 2004: 233-241 |
| 53 | EE | 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) |
| 2003 |
|---|
| 52 | | Concettina Guerra,
Sorin Istrail:
Mathematical Methods for Protein Structure Analysis and Design, Advanced Lectures
Springer 2003 |
| 51 | EE | Sorin Istrail:
The Minimum Informative Subset Problem.
BIOKDD 2003: 33 |
| 50 | EE | 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 |
| 49 | EE | 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 |
| 48 | EE | Giuseppe Lancia,
Sorin Istrail:
Protein Structure Comparison: Algorithms and Applications.
Mathematical Methods for Protein Structure Analysis and Design 2003: 1-33 |
| 47 | EE | 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 |
| 46 | | 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-20 (2003) |
| 2002 |
|---|
| 45 | EE | 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 |
| 44 | EE | Russell Schwartz,
Andrew G. Clark,
Sorin Istrail:
Inferring Piecewise Ancestral History from Haploid Sequences.
Computational Methods for SNPs and Haplotype Inference 2002: 62-73 |
| 43 | EE | 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 |
| 42 | EE | Russell Schwartz,
Andrew G. Clark,
Sorin Istrail:
Methods for Inferring Block-Wise Ancestral History from Haploid Sequences.
WABI 2002: 44-59 |
| 41 | | 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) |
| 2001 |
|---|
| 40 | EE | Giuseppe Lancia,
Vineet Bafna,
Sorin Istrail,
Ross Lippert,
Russell Schwartz:
SNPs Problems, Complexity, and Algorithms.
ESA 2001: 182-193 |
| 39 | EE | 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 |
| 38 | EE | 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 |
|---|
| 37 | EE | Deborah Goldman,
Sorin Istrail,
Giuseppe Lancia,
Antonio Piccolboni,
Brian Walenz:
Algorithmic strategies in combinatorial chemistry.
SODA 2000: 275-284 |
| 36 | EE | 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 |
| 35 | | Sorin Istrail,
Pavel A. Pevzner,
Ron Shamir:
Foreword.
Discrete Applied Mathematics 104(1-3): 1-2 (2000) |
| 34 | EE | William E. Hart,
Sorin Istrail:
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms.
J. UCS 6(6): 560-579 (2000) |
| 1999 |
|---|
| 33 | EE | Serafim Batzoglou,
Sorin Istrail:
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem.
CPM 1999: 66-77 |
| 32 | EE | Deborah Goldman,
Sorin Istrail,
Christos H. Papadimitriou:
Algorithmic Aspects of Protein Structure Similarity.
FOCS 1999: 512-522 |
| 31 | | Sorin Istrail,
Russell Schwartz,
Jonathan A. King:
Lattice Simulations of Aggregation Funnels for Protein Folding.
Journal of Computational Biology 6(2): 143-162 (1999) |
| 30 | | Sorin Istrail:
Preface: Special RECOMB'99 Issue.
Journal of Computational Biology 6(3/4): (1999) |
| 1998 |
|---|
| 29 | EE | Sorin Istrail,
Pavel A. Pevzner,
Ron Shamir:
Foreword.
Discrete Applied Mathematics 88(1-3): 3-6 (1998) |
| 1997 |
|---|
| 28 | EE | 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 |
| 27 | | 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) |
| 26 | | Michael S. Waterman,
Sorin Istrail,
Pavel A. Pevzner:
Selected Papers from RECOMB'97 - Preface.
Journal of Computational Biology 4(3): 215-216 (1997) |
| 25 | | 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-260 (1997) |
| 1996 |
|---|
| 24 | | William E. Hart,
Sorin Istrail:
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract).
CPM 1996: 288-303 |
| 23 | | 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) |
| 1995 |
|---|
| 22 | EE | William E. Hart,
Sorin Istrail:
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract).
STOC 1995: 157-168 |
| 21 | EE | Bard Bloom,
Sorin Istrail,
Albert R. Meyer:
Bisimulation Can't be Traced.
J. ACM 42(1): 232-268 (1995) |
| 20 | | 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) |
| 1994 |
|---|
| 19 | EE | 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) |
| 18 | | 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 |
|---|
| 17 | | Sorin Istrail,
Dejan Zivkovic:
A Non-Probabilistic Switching Lemma for the Sipser Function.
STACS 1993: 566-575 |
| 1992 |
|---|
| 16 | EE | Lenwood S. Heath,
Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g).
J. ACM 39(3): 479-501 (1992) |
| 1990 |
|---|
| 15 | | Sorin Istrail:
Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract)
FOCS 1990: 439-448 |
| 1989 |
|---|
| 14 | | Sorin Istrail:
An Arithmetical Hierarchy in Propositional Dynamic Logic
Inf. Comput. 81(3): 280-289 (1989) |
| 1988 |
|---|
| 13 | | Bard Bloom,
Sorin Istrail,
Albert R. Meyer:
Bisimulation Can't Be Traced.
POPL 1988: 229-239 |
| 12 | | Sorin Istrail:
Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract)
STOC 1988: 491-503 |
| 1987 |
|---|
| 11 | | Lenwood S. Heath,
Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g)
STOC 1987: 388-397 |
| 1983 |
|---|
| 10 | | Sorin Istrail,
Cristian Masalagiu:
Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization.
CAAP 1983: 255-268 |
| 9 | | Sorin Istrail,
Cristian Masalagiu:
Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization.
Theor. Comput. Sci. 26: 83-103 (1983) |
| 1982 |
|---|
| 8 | | 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) |
| 7 | | Sorin Istrail:
Some Remarks on Non-Algebraic Adherences.
Theor. Comput. Sci. 21: 341-349 (1982) |
| 1981 |
|---|
| 6 | | Sorin Istrail:
Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types.
ICALP 1981: 333-347 |
| 1979 |
|---|
| 5 | | Sorin Istrail:
A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs.
ICALP 1979: 289-303 |
| 4 | | Sorin Istrail:
On Complements of Some Bounded Context-Sensitive Languages
Information and Control 42(3): 283-289 (1979) |
| 1978 |
|---|
| 3 | | Sorin Istrail,
Dan A. Simovici:
Computing grammars and contex-sensitive languages.
ITA 12(1): (1978) |
| 2 | | Sorin Istrail:
Tag Systems Generating Thue Irreducible Sequences.
Inf. Process. Lett. 7(3): 129-131 (1978) |
| 1 | | Sorin Istrail:
Elementary Bounded Languages
Information and Control 39(2): 177-191 (1978) |
