Sorin Istrail

Affiliations:
  • Brown University, Providence, RI, USA


According to our database1, Sorin Istrail authored at least 80 papers between 1978 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Michael Waterman's Contributions to Computational Biology and Bioinformatics.
J. Comput. Biol., 2022

Special Issue: Professor Michael Waterman's 80th Birthday, Part 1.
J. Comput. Biol., 2022

2020
Preface Special Issue: RECOMB 2018.
J. Comput. Biol., 2020

Combinatorial and statistical prediction of gene expression from haplotype sequence.
Bioinform., 2020

2019
How Does the Regulatory Genome Work?
J. Comput. Biol., 2019

Eric Davidson's Regulatory Genome for Computer Science: Causality, Logic, and Proof Principles of the Genomic <i>cis</i>-Regulatory Code.
J. Comput. Biol., 2019

2015
Utilizing image-based features in biomedical document classification.
Proceedings of the 2015 IEEE International Conference on Image Processing, 2015

2014
Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding.
CoRR, 2014

Tractatus: An Exact and Subquadratic Algorithm for Inferring Identical-by-Descent Multi-shared Haplotype Tracts.
Proceedings of the Research in Computational Molecular Biology, 2014

Tumor Haplotype Assembly Algorithms for Cancer Genomics.
Proceedings of the Biocomputing 2014: Proceedings of the Pacific Symposium, 2014

2013
Haplotype assembly in polyploid genomes and identical by descent shared tracts.
Bioinform., 2013

2012
HapCompass: A Fast Cycle Basis Algorithm for Accurate Haplotype Assembly of Sequence Data.
J. Comput. Biol., 2012

QColors: An algorithm for conservative viral quasispecies reconstruction from short and non-contiguous next generation sequencing reads.
Silico Biol., 2012

DELISHUS: an efficient and exact algorithm for genome-wide detection of deletion polymorphism in autism.
Bioinform., 2012

dbPTB: a database for preterm birth.
Database J. Biol. Databases Curation, 2012

Alan Turing and John von Neumann - Their Brains and Their Computers.
Proceedings of the Membrane Computing, 2012

Workshop: Robust algorithms for inferring haplotype phase and deletion polymorphism from high-throughput whole genome sequence data.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

OCR-based image features for biomedical image and article classification: identifying documents relevant to cis-regulatory elements.
Proceedings of the ACM International Conference on Bioinformatics, 2012

OCR-Based Image Features for Biomedical Image and Article Classification: Identifying Documents Relevant to Genomic Cis-Regulatory Elements.
Proceedings of the Information Retrieval and Knowledge Discovery in Biomedical Text, 2012

2011
The Clark Phaseable Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS.
J. Comput. Biol., 2011

Conservative Extensions of Linkage Disequilibrium Measures from Pairwise to Multi-loci and Algorithms for Optimal Tagging SNP Selection.
Proceedings of the Research in Computational Molecular Biology, 2011

Haplotype Phasing By Multi-Assembly of Shared Haplotypes: Phase-Dependent Interactions Between Rare Variants.
Proceedings of the Biocomputing 2011: Proceedings of the Pacific Symposium, 2011

2010
The Imperfect Ancestral Recombination Graph Reconstruction Problem: Upper Bounds for Recombination and Homoplasy.
J. Comput. Biol., 2010

The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS.
Proceedings of the Research in Computational Molecular Biology, 2010

2009
Combinatorial Algorithms for Protein Folding in Lattice Models: A Survey of Mathematical Results.
Commun. Inf. Syst., 2009

On the Concept of Cis-regulatory Information: From Sequence Motifs to Logic Functions.
Proceedings of the Algorithmic Bioprocesses, 2009

2007
Preface.
Discret. Appl. Math., 2007

2006
Islands of Tractability for Parsimony Haplotyping.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

2005
Polynomial and APX-hard cases of the individual haplotyping problem.
Theor. Comput. Sci., 2005

Finding Anchors for Genomic Sequence Comparison.
J. Comput. Biol., 2005

Logic Functions of the Genomic Cis-regulatory Code.
Proceedings of the Unconventional Computation, 4th International Conference, 2005

2004
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap.
J. Comput. Biol., 2004

2003
Robustness of Inference of Haplotype Block Structure.
J. Comput. Biol., 2003

Haplotypes and informative SNP selection algorithms: don't block out information.
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

Protein Structure Comparison: Algorithms and Applications.
Proceedings of the Mathematical Methods for Protein Structure Analysis and Design, 2003

The Minimum Informative Subset Problem.
Proceedings of the 3nd ACM SIGKDD Workshop on Data Mining in Bioinformatics (BIOKDD 2003), 2003

Combinatorial Problems Arising in SNP and Haplotype Analysis.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Epitope Prediction Algorithms for Peptide based Vaccine Design.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem.
Briefings Bioinform., 2002

Methods for Inferring Block-Wise Ancestral History from Haploid Sequences.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Inferring Piecewise Ancestral History from Haploid Sequences.
Proceedings of the Computational Methods for SNPs and Haplotype Inference, 2002

A Survey of Computational Methods for Determining Haplotypes.
Proceedings of the Computational Methods for SNPs and Haplotype Inference, 2002

2001
101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Visualization challenges for a new cyberpharmaceutical computing paradigm.
Proceedings of the IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics, 2001

SNPs Problems, Complexity, and Algorithms.
Proceedings of the Algorithms, 2001

2000
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms.
J. Univers. Comput. Sci., 2000

Foreword.
Discret. Appl. Math., 2000

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).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Algorithmic strategies in combinatorial chemistry.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Lattice Simulations of Aggregation Funnels for Protein Folding.
J. Comput. Biol., 1999

Preface: Special RECOMB'99 Issue.
J. Comput. Biol., 1999

Algorithmic Aspects of Protein Structure Similarity.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1997
Selected Papers from RECOMB'97 - Preface.
J. Comput. Biol., 1997

Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials.
J. Comput. Biol., 1997

Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal.
J. Comput. Biol., 1997

Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

1996
Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal.
J. Comput. Biol., 1996

Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Physical Mapping by STS Hybridization: Algorithmic Strategies and the Challenge of Software Evaluation.
J. Comput. Biol., 1995

Bisimulation Can't be Traced.
J. ACM, 1995

Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC^0.
Inf. Process. Lett., 1994

The Chimeric Mapping Problem: Algorithmic Strategies and Performance Evaluation on Synthetic Genomic Data.
Comput. Chem., 1994

1993
A Non-Probabilistic Switching Lemma for the Sipser Function.
Proceedings of the STACS 93, 1993

1992
The Pagenumber of Genus g Graphs is O(g).
J. ACM, 1992

1990
Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
An Arithmetical Hierarchy in Propositional Dynamic Logic
Inf. Comput., June, 1989

1988
Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1983
Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization.
Theor. Comput. Sci., 1983

Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization.
Proceedings of the CAAP'83, 1983

1982
Some Remarks on Non-Algebraic Adherences.
Theor. Comput. Sci., 1982

Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages.
Theor. Comput. Sci., 1982

1981
Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types.
Proceedings of the Automata, 1981

1979
On Complements of Some Bounded Context-Sensitive Languages
Inf. Control., May, 1979

A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs.
Proceedings of the Automata, 1979

1978
Elementary Bounded Languages
Inf. Control., November, 1978

Computing grammars and contex-sensitive languages.
RAIRO Theor. Informatics Appl., 1978

Tag Systems Generating Thue Irreducible Sequences.
Inf. Process. Lett., 1978


  Loading...