The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sorin Istrail: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sorin Istrail, Cristian Masalagiu
    Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:255-268 [Conf]
  2. Serafim Batzoglou, Sorin Istrail
    Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:66-77 [Conf]
  3. William E. Hart, Sorin Istrail
    Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:288-303 [Conf]
  4. Liliana Florea, Bjarni V. Halldórsson, Oliver Kohlbacher, Russell Schwartz, Stephen Hoffman, Sorin Istrail
    Epitope Prediction Algorithms for Peptide based Vaccine Design. [Citation Graph (0, 0)][DBLP]
    CSB, 2003, pp:17-26 [Conf]
  5. Roded Sharan, Bjarni V. Halldórsson, Sorin Istrail
    Islands of Tractability for Parsimony Haplotyping. [Citation Graph (0, 0)][DBLP]
    CSB, 2005, pp:65-72 [Conf]
  6. Bjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail
    Combinatorial Problems Arising in SNP and Haplotype Analysis. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:26-47 [Conf]
  7. Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz
    SNPs Problems, Complexity, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:182-193 [Conf]
  8. Deborah Goldman, Sorin Istrail, Christos H. Papadimitriou
    Algorithmic Aspects of Protein Structure Similarity. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:512-522 [Conf]
  9. Sorin Istrail
    Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:439-448 [Conf]
  10. Sorin Istrail
    A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:289-303 [Conf]
  11. Sorin Istrail
    Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:333-347 [Conf]
  12. Sorin Istrail
    The Minimum Informative Subset Problem. [Citation Graph (0, 0)][DBLP]
    BIOKDD, 2003, pp:33- [Conf]
  13. Giuseppe Lancia, Sorin Istrail
    Protein Structure Comparison: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    Mathematical Methods for Protein Structure Analysis and Design, 2003, pp:1-33 [Conf]
  14. Bard Bloom, Sorin Istrail, Albert R. Meyer
    Bisimulation Can't Be Traced. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:229-239 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2001, pp:7-18 [Conf]
  16. Vineet Bafna, Bjarni V. Halldórsson, Russell Schwartz, Andrew G. Clark, Sorin Istrail
    Haplotypes and informative SNP selection algorithms: don't block out information. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2003, pp:19-27 [Conf]
  17. 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. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:137-146 [Conf]
  18. Bjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail
    A Survey of Computational Methods for Determining Haplotypes. [Citation Graph (0, 0)][DBLP]
    Computational Methods for SNPs and Haplotype Inference, 2002, pp:26-47 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:193-202 [Conf]
  20. Ross Lippert, Xiaoyue Zhao, Liliana Florea, Clark Mobarry, Sorin Istrail
    Finding anchors for genomic sequence comparison. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2004, pp:233-241 [Conf]
  21. Russell Schwartz, Andrew G. Clark, Sorin Istrail
    Inferring Piecewise Ancestral History from Haploid Sequences. [Citation Graph (0, 0)][DBLP]
    Computational Methods for SNPs and Haplotype Inference, 2002, pp:62-73 [Conf]
  22. Deborah Goldman, Sorin Istrail, Giuseppe Lancia, Antonio Piccolboni, Brian Walenz
    Algorithmic strategies in combinatorial chemistry. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:275-284 [Conf]
  23. Sorin Istrail, Dejan Zivkovic
    A Non-Probabilistic Switching Lemma for the Sipser Function. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:566-575 [Conf]
  24. William E. Hart, Sorin Istrail
    Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:157-168 [Conf]
  25. Lenwood S. Heath, Sorin Istrail
    The Pagenumber of Genus g Graphs is O(g) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:388-397 [Conf]
  26. 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). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:87-96 [Conf]
  27. Sorin Istrail
    Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:491-503 [Conf]
  28. Eric H. Davidson, Sorin Istrail
    Logic Functions of the Genomic Cis-regulatory Code. [Citation Graph (0, 0)][DBLP]
    UC, 2005, pp:19-19 [Conf]
  29. Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia
    Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:29-43 [Conf]
  30. Russell Schwartz, Andrew G. Clark, Sorin Istrail
    Methods for Inferring Block-Wise Ancestral History from Haploid Sequences. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:44-59 [Conf]
  31. Ross Lippert, Russell Schwartz, Giuseppe Lancia, Sorin Istrail
    Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. [Citation Graph (0, 0)][DBLP]
    Briefings in Bioinformatics, 2002, v:3, n:1, pp:23-31 [Journal]
  32. David S. Greenberg, Sorin Istrail
    The Chimeric Mapping Problem: Algorithmic Strategies and Performance Evaluation on Synthetic Genomic Data. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 1994, v:18, n:3, pp:207-220 [Journal]
  33. Sorin Istrail, Pavel A. Pevzner, Ron Shamir
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:1-2 [Journal]
  34. Sorin Istrail, Pavel A. Pevzner, Ron Shamir
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:3-6 [Journal]
  35. Sorin Istrail, Pavel A. Pevzner, Ron Shamir
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:673-674 [Journal]
  36. Sorin Istrail
    Elementary Bounded Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:39, n:2, pp:177-191 [Journal]
  37. Sorin Istrail
    On Complements of Some Bounded Context-Sensitive Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:42, n:3, pp:283-289 [Journal]
  38. Sorin Istrail
    An Arithmetical Hierarchy in Propositional Dynamic Logic [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:3, pp:280-289 [Journal]
  39. Sorin Istrail
    Tag Systems Generating Thue Irreducible Sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:3, pp:129-131 [Journal]
  40. Sorin Istrail, Dejan Zivkovic
    Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC^0. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:4, pp:211-216 [Journal]
  41. Sorin Istrail, Dan A. Simovici
    Computing grammars and contex-sensitive languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1978, v:12, n:1, pp:- [Journal]
  42. Bard Bloom, Sorin Istrail, Albert R. Meyer
    Bisimulation Can't be Traced. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:232-268 [Journal]
  43. Lenwood S. Heath, Sorin Istrail
    The Pagenumber of Genus g Graphs is O(g). [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:479-501 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:1, pp:27-52 [Journal]
  45. David S. Greenberg, Sorin Istrail
    Physical Mapping by STS Hybridization: Algorithmic Strategies and the Challenge of Software Evaluation. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1995, v:2, n:2, pp:219-273 [Journal]
  46. William E. Hart, Sorin Istrail
    Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1996, v:3, n:1, pp:53-96 [Journal]
  47. William E. Hart, Sorin Istrail
    Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:3, pp:241-260 [Journal]
  48. William E. Hart, Sorin Istrail
    Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:1, pp:1-22 [Journal]
  49. Sorin Istrail
    Preface: Special RECOMB'99 Issue. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:3/4, pp:- [Journal]
  50. Sorin Istrail, Russell Schwartz, Jonathan A. King
    Lattice Simulations of Aggregation Funnels for Protein Folding. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:2, pp:143-162 [Journal]
  51. Ross A. Lippert, Xiaoyue Zhao, Liliana Florea, Clark Mobarry, Sorin Istrail
    Finding Anchors for Genomic Sequence Comparison. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2005, v:12, n:6, pp:762-776 [Journal]
  52. Russell Schwartz, Bjarni V. Halldórsson, Vineet Bafna, Andrew G. Clark, Sorin Istrail
    Robustness of Inference of Haplotype Block Structure. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:1, pp:13-20 [Journal]
  53. Michael S. Waterman, Sorin Istrail, Pavel A. Pevzner
    Selected Papers from RECOMB'97 - Preface. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:3, pp:215-216 [Journal]
  54. William E. Hart, Sorin Istrail
    Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:6, pp:560-579 [Journal]
  55. Roded Sharan, Bjarni V. Halldórsson, Sorin Istrail
    Islands of Tractability for Parsimony Haplotyping. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:3, pp:303-311 [Journal]
  56. Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi
    Polynomial and APX-hard cases of the individual haplotyping problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:1, pp:109-125 [Journal]
  57. Sorin Istrail
    Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:333-341 [Journal]
  58. Sorin Istrail
    Some Remarks on Non-Algebraic Adherences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:341-349 [Journal]
  59. Sorin Istrail, Cristian Masalagiu
    Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:83-103 [Journal]

  60. The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002