default search action
Sorin Istrail
Person information
- affiliation: Brown University, Providence, RI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j43]Sorin Istrail, Pavel A. Pevzner, Fengzhu Sun, Martin Vingron:
Special Issue: Professor Michael Waterman's 80th Birthday, Part 1. J. Comput. Biol. 29(7): 599-600 (2022) - [j42]Pavel A. Pevzner, Martin Vingron, Christian M. Reidys, Fengzhu Sun, Sorin Istrail:
Michael Waterman's Contributions to Computational Biology and Bioinformatics. J. Comput. Biol. 29(7): 601-615 (2022) - 2020
- [j41]Berk A. Alpay
, Pinar Demetci
Combinatorial and statistical prediction of gene expression from haplotype sequence. Bioinform. 36(Supplement-1): i194-i202 (2020) - [j40]Sorin Istrail:
Preface Special Issue: RECOMB 2018. J. Comput. Biol. 27(3): 301 (2020)
2010 – 2019
- 2019
- [j39]Sorin Istrail:
Eric Davidson's Regulatory Genome for Computer Science: Causality, Logic, and Proof Principles of the Genomic cis-Regulatory Code. J. Comput. Biol. 26(7): 653-684 (2019) - [j38]Sorin Istrail, Isabelle S. Peter
How Does the Regulatory Genome Work? J. Comput. Biol. 26(7) (2019) - 2015
- [c42]Kaidi Ma, Hogyeong Jeong, M. V. Rohith, Gowri Somanath, Ryan Tarpine, Kyle Schutter, Dorothea Blostein, Sorin Istrail, Chandra Kambhamettu, Hagit Shatkay:
Utilizing image-based features in biomedical document classification. ICIP 2015: 4451-4455 - 2014
- [c41]Derek Aguiar, Wendy S. W. Wong, Sorin Istrail:
Tumor Haplotype Assembly Algorithms for Cancer Genomics. Pacific Symposium on Biocomputing 2014: 3-14 - [c40]Derek Aguiar
Tractatus: An Exact and Subquadratic Algorithm for Inferring Identical-by-Descent Multi-shared Haplotype Tracts. RECOMB 2014: 1-17 - [i1]Hammurabi Mendes, Sorin Istrail:
Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding. CoRR abs/1404.0672 (2014) - 2013
- [j37]Derek Aguiar
Haplotype assembly in polyploid genomes and identical by descent shared tracts. Bioinform. 29(13): 352-360 (2013) - 2012
- [j36]Alper Uzun
dbPTB: a database for preterm birth. Database J. Biol. Databases Curation 2012 (2012) - [j35]Derek Aguiar
DELISHUS: an efficient and exact algorithm for genome-wide detection of deletion polymorphism in autism. Bioinform. 28(12): 154-162 (2012) - [j34]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. Silico Biol. 11(5-6): 193-201 (2012) - [j33]Derek Aguiar
HapCompass: A Fast Cycle Basis Algorithm for Accurate Haplotype Assembly of Sequence Data. J. Comput. Biol. 19(6): 577-590 (2012) - [c39]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 Genomic Cis-Regulatory Elements. AAAI Fall Symposium: Information Retrieval and Knowledge Discovery in Biomedical Text 2012 - [c38]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 - [c37]Derek Aguiar
Workshop: Robust algorithms for inferring haplotype phase and deletion polymorphism from high-throughput whole genome sequence data. ICCABS 2012: 1 - [c36]Sorin Istrail, Solomon Marcus:
Alan Turing and John von Neumann - Their Brains and Their Computers. Int. Conf. on Membrane Computing 2012: 26-35 - [e10]Sorin Istrail, Ion I. Mandoiu, Mihai Pop, Sanguthevar Rajasekaran, John L. Spouge:
IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2012, Las Vegas, NV, USA, February 23-25, 2012. IEEE Computer Society 2012, ISBN 978-1-4673-1320-9 [contents] - 2011
- [j32]Bjarni V. Halldórsson
The Clark Phaseable Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS. J. Comput. Biol. 18(3): 323-333 (2011) - [c35]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 - [c34]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 - [c33]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
- [j31]Fumei Lam, Ryan Tarpine, Sorin Istrail:
The Imperfect Ancestral Recombination Graph Reconstruction Problem: Upper Bounds for Recombination and Homoplasy. J. Comput. Biol. 17(6): 767-781 (2010) - [c32]Bjarni V. Halldórsson
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS. RECOMB 2010: 158-173
2000 – 2009
- 2009
- [j30]Sorin Istrail, Fumei Lam:
Combinatorial Algorithms for Protein Folding in Lattice Models: A Survey of Mathematical Results. Commun. Inf. Syst. 9(4): 303-346 (2009) - [c31]Ryan Tarpine, Sorin Istrail:
On the Concept of Cis-regulatory Information: From Sequence Motifs to Logic Functions. Algorithmic Bioprocesses 2009: 731-742 - 2007
- [j29]Sorin Istrail, Pavel A. Pevzner, Ron Shamir
Preface. Discret. Appl. Math. 155(6-7): 673-674 (2007) - 2006
- [j28]Roded Sharan, Bjarni V. Halldórsson
Islands of Tractability for Parsimony Haplotyping. IEEE ACM Trans. Comput. Biol. Bioinform. 3(3): 303-311 (2006) - [e9]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. Lecture Notes in Computer Science 3909, Springer 2006, ISBN 3-540-33295-2 [contents] - 2005
- [j27]Ross A. Lippert, Xiaoyue Zhao, Liliana Florea, Clark M. Mobarry, Sorin Istrail:
Finding Anchors for Genomic Sequence Comparison. J. Comput. Biol. 12(6): 762-776 (2005) - [j26]Vineet Bafna, Sorin Istrail, Giuseppe Lancia
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
Islands of Tractability for Parsimony Haplotyping. CSB 2005: 65-72 - [c29]Eric H. Davidson, Sorin Istrail:
Logic Functions of the Genomic Cis-regulatory Code. UC 2005: 19-19 - [e8]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. Lecture Notes in Computer Science 3500, Springer 2005, ISBN 3-540-25866-3 [contents] - 2004
- [j25]Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. J. Comput. Biol. 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 - [e7]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. Lecture Notes in Computer Science 2983, Springer 2004, ISBN 3-540-21249-3 [contents] - 2003
- [j24]Russell Schwartz
Robustness of Inference of Haplotype Block Structure. J. Comput. Biol. 10(1): 13-19 (2003) - [c27]Liliana Florea, Bjarni V. Halldórsson
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]Sorin Istrail:
The Minimum Informative Subset Problem. BIOKDD 2003: 33 - [c24]Giuseppe Lancia
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 - [e6]Concettina Guerra, Sorin Istrail:
Mathematical Methods for Protein Structure Analysis and Design, Advanced Lectures. Lecture Notes in Computer Science 2666, Springer 2003, ISBN 3-540-40104-0 [contents] - [e5]Martin Vingron, Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman, Webb Miller:
Proceedings of the Sventh Annual International Conference on Computational Biology, RECOMB 2003, Berlin, Germany, April 10-13, 2003. ACM 2003, ISBN 1-58113-635-8 [contents] - 2002
- [j23]Ross Lippert, Russell Schwartz, Giuseppe Lancia
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings Bioinform. 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
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. WABI 2002: 29-43 - [c19]Russell Schwartz, Andrew G. Clark
Methods for Inferring Block-Wise Ancestral History from Haploid Sequences. WABI 2002: 44-59 - [e4]Gene Myers, Sridhar Hannenhalli, David Sankoff, Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman:
Proceedings of the Sixth Annual International Conference on Computational Biology, RECOMB 2002, Washington, DC, USA, April 18-21, 2002. ACM 2002, ISBN 1-58113-498-3 [contents] - 2001
- [c18]Giuseppe Lancia
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. Discret. Appl. Math. 104(1-3): 1-2 (2000) - [j21]William E. Hart, Sorin Istrail:
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms. J. Univers. Comput. Sci. 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 - [e3]Ron Shamir, Satoru Miyano, Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman:
Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, RECOMB 2000, Tokyo, Japan, April 8-11, 2000. ACM 2000, ISBN 1-58113-186-0 [contents]
1990 – 1999
- 1999
- [j20]Sorin Istrail, Russell Schwartz, Jonathan A. King:
Lattice Simulations of Aggregation Funnels for Protein Folding. J. Comput. Biol. 6(2): 143-162 (1999) - [j19]Sorin Istrail:
Preface: Special RECOMB'99 Issue. J. Comput. Biol. 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 - [e2]Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman:
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, RECOMB 1999, Lyon, France, April 11-14, 1999. ACM 1999, ISBN 1-58113-069-4 [contents] - 1998
- [j18]Sorin Istrail, Pavel A. Pevzner, Ron Shamir
Foreword. Discret. Appl. Math. 88(1-3): 3-6 (1998) - [e1]Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman:
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, RECOMB 1998, New York, NY, USA, March 22-25, 1998. ACM 1998, ISBN 0-89791-976-9 [contents] - 1997
- [j17]William E. Hart, Sorin Istrail:
Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials. J. Comput. Biol. 4(1): 1-22 (1997) - [j16]Michael S. Waterman, Sorin Istrail, Pavel A. Pevzner:
Selected Papers from RECOMB'97 - Preface. J. Comput. Biol. 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. J. Comput. Biol. 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. J. Comput. Biol. 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. J. Comput. Biol. 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. Comput. Chem. 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
1980 – 1989
- 1989
- [j8]Sorin Istrail:
An Arithmetical Hierarchy in Propositional Dynamic Logic. Inf. Comput. 81(3): 280-289 (1989) - 1988
- [c6]Bard Bloom, Sorin Istrail, Albert R. Meyer:
Bisimulation Can't Be Traced. POPL 1988: 229-239 - [c5]Sorin Istrail:
Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract). STOC 1988: 491-503 - 1987
- [c4]Lenwood S. Heath, Sorin Istrail:
The Pagenumber of Genus g Graphs is O(g). STOC 1987: 388-397 - 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]Sorin Istrail:
Some Remarks on Non-Algebraic Adherences. Theor. Comput. Sci. 21: 341-349 (1982) - 1981
- [c2]Sorin Istrail:
Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types. ICALP 1981: 333-347
1970 – 1979
- 1979
- [j4]Sorin Istrail:
On Complements of Some Bounded Context-Sensitive Languages. Inf. 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]Sorin Istrail:
Elementary Bounded Languages. Inf. Control. 39(2): 177-191 (1978) - [j2]Sorin Istrail:
Tag Systems Generating Thue Irreducible Sequences. Inf. Process. Lett. 7(3): 129-131 (1978) - [j1]Sorin Istrail, Dan A. Simovici:
Computing grammars and contex-sensitive languages. RAIRO Theor. Informatics Appl. 12(1): 33-48 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: