Sorin Istrail
Sorin Istrail
Verified email at
Cited by
Cited by
The sequence of the human genome
JC Venter, MD Adams, EW Myers, PW Li, RJ Mural, GG Sutton, HO Smith, ...
science 291 (5507), 1304-1351, 2001
The genome of the sea urchin Strongylocentrotus purpuratus
E Sodergren, GM Weinstock, EH Davidson, RA Cameron, RA Gibbs, ...
Science 314 (5801), 941-952, 2006
Bisimulation can't be traced
B Bloom, S Istrail, AR Meyer
Journal of the ACM (JACM) 42 (1), 232-268, 1995
SNPs problems, complexity, and algorithms
G Lancia, V Bafna, S Istrail, R Lippert, R Schwartz
European symposium on algorithms, 182-193, 2001
Whole-genome shotgun assembly and comparison of human genome assemblies
S Istrail, GG Sutton, L Florea, AL Halpern, CM Mobarry, R Lippert, ...
Proceedings of the National Academy of Sciences 101 (7), 1916-1921, 2004
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem
R Lippert, R Schwartz, G Lancia, S Istrail
Briefings in bioinformatics 3 (1), 23-31, 2002
Algorithmic aspects of protein structure similarity
D Goldman, S Istrail, CH Papadimitriou
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
Logic functions of the genomic cis-regulatory code
S Istrail, EH Davidson
Proceedings of the National Academy of Sciences 102 (14), 4954-4959, 2005
Fast protein folding in the hydrophobic–hydrophilic model within three-eighths of optimal
WE Hart, SC Istrail
Journal of computational biology 3 (1), 53-96, 1996
Robust proofs of NP-hardness for protein folding: general lattices and energy potentials
WE Hart, S Istrail
Journal of Computational Biology 4 (1), 1-22, 1997
1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap
A Caprara, R Carr, S Istrail, G Lancia, B Walenz
Journal of Computational Biology 11 (1), 27-52, 2004
101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem
G Lancia, R Carr, B Walenz, S Istrail
Proceedings of the fifth annual international conference on Computational …, 2001
Bisimulation can't be traced: preliminary report
B Bloom, S Istrail, AR Meyer
Massachusetts Institute of Technology. Laboratory for Computer Science, 1987
Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces
S Istrail
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
Optimal haplotype block-free selection of tagging SNPs for genome-wide association studies
BV Halldorsson, V Bafna, R Lippert, R Schwartz, M Francisco, AG Clark, ...
Genome research 14 (8), 1633-1640, 2004
A survey of computational methods for determining haplotypes
BV Halldórsson, V Bafna, N Edwards, R Lippert, S Yooseph, S Istrail
RECOMB Workshop on Computational Methods for SNPs and Haplotype Inference, 26-47, 2002
Haplotypes and informative SNP selection algorithms: don't block out information
V Bafna, BV Halldórsson, R Schwartz, AG Clark, S Istrail
Proceedings of the seventh annual international conference on Research in …, 2003
HapCompass: a fast cycle basis algorithm for accurate haplotype assembly of sequence data
D Aguiar, S Istrail
Journal of Computational Biology 19 (6), 577-590, 2012
Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem
R Rizzi, V Bafna, S Istrail, G Lancia
International Workshop on Algorithms in Bioinformatics, 29-43, 2002
The transcriptome of the sea urchin embryo
MP Samanta, W Tongprasit, S Istrail, RA Cameron, Q Tu, EH Davidson, ...
Science 314 (5801), 960-962, 2006
The system can't perform the operation now. Try again later.
Articles 1–20