Sorin Istrail's Homepage :: Publications

1. Lippert, R., X. Zhao, L. Florea, C. Mobarry, S. Istrail (2004), Finding anchors for genomic sequence comparison, Proceedings of the 8th Annual International Conference on Research in Computational Biology (RECOMB04), ACM Press 2004
   
   
2. Vineet Bafna, Bjarni V. Halld\'orsson, Russell S. Schwartz, Andrew G. Clark, Sorin Istrail, Haplotypes and Informative SNP Selection Algorithms: Don't Block Out Information, , Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB03) , ACM Press, pp. 19-27, 2003
   
   
3. G. Lancia, R. Carr, B. Walenz, S. Istrail, 101 Optimal PDB Structure Alignments: A Branch-and-Cut Algorithm for the Maximum Contact Map Overlap Problem, Proceeding of the Fifth International Conference on Research on Computational Biology, (RECOMB01), ACM Press, p. 201-211, 2001
   
   
4. S. Istrail, Statistical Mechanics, Three-Dimensionality and NP-Completeness: I. Universality of Intractability of the Partition Functions of the Ising Model Across Non-Planar Lattices, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC00), ACM Press, p. 87-96, Portland, Oregon, May 21-23, 2000
   
   
5. D. Goldman, S. Istrail, G. Lancia, A. Piccolboni, B. Walenz, Algorithmic Strategies in Combinatorial Chemistry, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA00), ACM Press, January 2000.
   
   
6. D. Goldman, S. Istrail, C. Papadimitriou, Algorithmic Aspects of Protein Structure Similarity, Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS99), IEEE Computer Society Press, October 1999
   
   
7. W. E. Hart, S. Istrail, Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86\% of Optimal (Extended Abstract), First International Conference on Computational Molecular Biology, (RECOMB97), ACM Press, January 20-23, pp. 137-146, 1997
   
   
8. W. E. Hart, S. Istrail, Fast Protein Folding in the Hydrophobic-Hydrophilic Model Within Three-eighths of Optimal (Extended Abstract), Proceedings of 27th Annual ACM Symposium on Theory of Computation (STOC95), ACM Press, pp. 157-168, 1995
   
   
9. S. Istrail, Constructing generalized universal traversal sequences of polynomial size for graphs of small diameter, Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS90), IEEE Computer Society Press pp. 439-448, 1990
   
   
10. S. Istrail, Polynomial universal traversal sequences for cycles are constructible, Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC88), ACM Press, pp. 491-453, 1988
    
    
11. B. Bloom, S. Istrail, A. R. Meyer, Bisimulation can't be traced, Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages (POPL88), ACM Press, pp. 229-239, 1988
    
    
12. L. Heath, S. Istrail, The pagenumber of genus g graphs is O(g), Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC87)}, ACM Press, pp. 388-397, 1987
    
    
13. S. Istrail, Chomsky-Schutzenberger representations for families of languages and grammatical types, Proceeding of the International Conference on Automata, Languages and Programming (ICALP81)} Springer Lecture Notes in Computer Science, No. 115, New York, pp. 333-347, 1981
    
    
14. S. Istrail, A fixed-point theorem for recursive-enumerable languages and some considerations about semantics of monadic programs, Proceeding of the International Conference on Automata, Languages and programming (ICALP79), Springer Lecture Notes in Computer Science, No. 71, New York, pp. 289-303, 1979

Competitive Conferences

1. Bjarni Halldorsson, Roded Sharan, and Sorin Istrail, Islands of Tractability for Parsimony Haplotyping, Proceedings of the Stanford Computational Systems Biology, pp. 65-72 (IEEE/ACM Transactions on Computational Biology and Bioinformatics, in press.), 2005
   
   
2. Liliana Florea, Bjarni V. Halld\'{o}rsson, Oliver Kohlbacher, Russell S. Schwartz, Stephen Hoffman, Sorin Istrail, Epitope prediction algorithms for peptide-based vaccine design, Proceedings of the Second Annual IEEE Computer Society Bioinformatics Conference (CSB03), IEEE Press, pp. 17-26, 2003
   
   
3. Bjarni V. Halld\'{o}rsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail, A survey of computational methods for determining haplotypes, Proceedings of the First RECOMB Satellite on Computational Methods for SNPs and Haplotype Inference, (RECOMB SNP\&HAP03), Springer Lecture Notes in Bioinformatics, LNBI 2983, pp. 26-47, 2003
   
   
4. R. Schwartz, A. Clark, S. Istrail, Inferring piecewise ancestral sequences from haploid sequences, Proceedings of the First RECOMB Satellite on Computational Methods for SNPs and Haplotype Inference, (RECOMB SNP\&HAP03), Springer Lecture Notes in Bioinformatics, LNBI 2983, 2003
   
   
5. Bjarni V. Halld\'{o}rsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail, Combinatorial problems arising in SNP and haplotype analysis, Proceedings of the Fourth International Conference on Discrete Mathematics and Theoretical Computer Science, (CDMTCS03), Springer Lecture Notes in Computer Science, pp. 26-47, 2003
   
   
6. Rizzi, R., V. Bafna, S. Istrail, G. Lancia, Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem, Proceeding of the 2nd Workshop on Algorithms in Bioinformatics, (WABI02), Springer Lecture Notes in Computer Science, 29-43, 2002
   
7. Schwartz, R., A. Clark, S. Istrail, Methods for inferring block-wise ancestral history from haploid sequences: The haplotype coloring problem, Proceedings of the 2nd Workshop on Algorithms in Bioinformatics, (WABI02), Springer Lecture Notes in Computer Science, 44-59, 2002
   
8. G. Lancia, V. Bafna, S. Istrail, R. Lippert, R. Schwartz, SNPs Problems: Complexity and Algorithms, Proceedings of the 3rd European Symposium on Algorithms, (EAS01) Springer Lecture Notes in Computer Science, 2161, p. 182-193, 2001
   
9. R. Turner, K. Chaturvedi, N. Edwards, D. Fasulo, A. Halpern, D. Huson, O. Kohlbacher, J. Miller, K. Reinert, K. Remington, R. Schwartz, B. Walenz, S. Yooseph, S. Istrail, Visualization Challenges for a New Cyberpharmaceutical Computing Paradigm, Proceedings of the Symposium on Large-Data Visualization and Graphics}, San Diego, California, October 22-23, 2001
   
   
10. S. Batzoglou, S. Istrail, Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem, Proceedings of the 10th Conference on Combinatorial Pattern Matching (CPM99), Springer Lectures Notes in Computer Science, Warwick, England, July 1999
    
    
11. W. E. Hart, S. Istrail, Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms, Proceedings of the 7th Conference on Combinatorial Pattern Matching (CPM96), Springer Lecture Notes in Computer Science, pp. 288-303, June 1996
    
    
12. D. Zivkovic, S. Istrail, A non-probabilistic switching lemma for the Sipser function}, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS93), Springer Lecture Notes in Computer Science, No.665, pp. 566-575, 1993
    
    
13. C. Masalagiu, S. Istrail, On protection in Nivat processing systems}, Proceedings of the Colloquium of Automata and Programming (CAAP83)}, Springer Lecture Notes in Computer Science, No. 159, New York, pp. 255-268, 1983