2008 |
30 | EE | Sridhar Hannenhalli:
Eukaryotic transcription factor binding sites - modeling and integrative search methods.
Bioinformatics 24(11): 1325-1331 (2008) |
29 | EE | Raffaele Giancarlo,
Sridhar Hannenhalli:
Guest Editors' Introduction to the Special Section on Algorithms in Bioinformatics.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 482-483 (2008) |
2007 |
28 | | Raffaele Giancarlo,
Sridhar Hannenhalli:
Algorithms in Bioinformatics, 7th International Workshop, WABI 2007, Philadelphia, PA, USA, September 8-9, 2007, Proceedings
Springer 2007 |
2006 |
27 | EE | Perry Evans,
Greg Donahue,
Sridhar Hannenhalli:
Conservation Patterns in cis-Elements Reveal Compensatory Mutations.
Comparative Genomics 2006: 186-199 |
26 | EE | Logan Everett,
Li-San Wang,
Sridhar Hannenhalli:
Dense subgraph computation via stochastic search: application to detect transcriptional modules.
ISMB (Supplement of Bioinformatics) 2006: 117-123 |
2005 |
25 | EE | Sridhar Hannenhalli,
Li-San Wang:
Enhanced position weight matrices using mixture models.
ISMB (Supplement of Bioinformatics) 2005: 204-212 |
24 | EE | Li-San Wang,
Shane T. Jensen,
Sridhar Hannenhalli:
An Interaction-Dependent Model for Transcription Factor Binding.
Systems Biology and Regulatory Genomics 2005: 225-234 |
23 | EE | Junwen Wang,
Sridhar Hannenhalli:
Generalizations of Markov model to characterize biological sequences.
BMC Bioinformatics 6: 219 (2005) |
2004 |
22 | EE | Vineet Bafna,
Dan Gusfield,
Sridhar Hannenhalli,
Shibu Yooseph:
A Note on Efficient Computation of Haplotypes via Perfect Phylogeny.
Journal of Computational Biology 11(5): 858-866 (2004) |
2002 |
21 | EE | Piotr Berman,
Sridhar Hannenhalli,
Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals.
ESA 2002: 200-210 |
2001 |
20 | | Sridhar Hannenhalli,
Samuel Levy:
Promoter prediction in the human genome.
ISMB (Supplement of Bioinformatics) 2001: 90-96 |
19 | | Samuel Levy,
Sridhar Hannenhalli,
Christopher T. Workman:
Enrichment of regulatory signals in conserved non-coding genomic sequence.
Bioinformatics 17(10): 871-877 (2001) |
18 | EE | Piotr Berman,
Sridhar Hannenhalli,
Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals
Electronic Colloquium on Computational Complexity (ECCC) 8(47): (2001) |
2000 |
17 | | Vineet Bafna,
Sridhar Hannenhalli,
Ken Rice,
Lisa Vawter:
Ligand-Receptor Pairing Via Tree Comparison.
Journal of Computational Biology 7(1-2): 59-70 (2000) |
1999 |
16 | EE | Sridhar Hannenhalli,
Pavel A. Pevzner:
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals.
J. ACM 46(1): 1-27 (1999) |
1997 |
15 | EE | Richa Agarwala,
Serafim Batzoglou,
Vlado Dancík,
Scott E. Decatur,
Martin Farach,
Sridhar Hannenhalli,
S. Muthukrishnan,
Steven Skiena:
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model.
RECOMB 1997: 1-2 |
14 | | Richa Agarwala,
Serafim Batzoglou,
Vlado Dancík,
Scott E. Decatur,
Martin Farach,
Sridhar Hannenhalli,
Steven Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.
SODA 1997: 390-399 |
13 | | Vlado Dancík,
Sridhar Hannenhalli,
S. Muthukrishnan:
Hardness of Flip-Cut Problems from Optical Mapping.
Journal of Computational Biology 4(2): 119-126 (1997) |
12 | | Richa Agarwala,
Serafim Batzoglou,
Vlado Dancík,
Scott E. Decatur,
Sridhar Hannenhalli,
Martin Farach,
S. Muthukrishnan,
Steven Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.
Journal of Computational Biology 4(3): 275-296 (1997) |
1996 |
11 | | Piotr Berman,
Sridhar Hannenhalli:
Fast Sorting by Reversal.
CPM 1996: 168-185 |
10 | | Sridhar Hannenhalli,
Pavel A. Pevzner:
To Cut... or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution).
SODA 1996: 304-313 |
9 | | Sridhar Hannenhalli,
W. Feldman,
H. F. Lewis,
Steven Skiena,
Pavel A. Pevzner:
Positional sequencing by hybridization.
Computer Applications in the Biosciences 12(1): 19-24 (1996) |
8 | EE | Sridhar Hannenhalli:
Polynomial-time Algorithm for Computing Translocation Distance Between Genomes.
Discrete Applied Mathematics 71(1-3): 137-151 (1996) |
1995 |
7 | | Sridhar Hannenhalli:
Polynomial-time Algorithm for Computing Translocation Distance between Genomes.
CPM 1995: 162-176 |
6 | | Sridhar Hannenhalli,
Pavel A. Pevzner:
Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem).
FOCS 1995: 581-592 |
5 | EE | Sridhar Hannenhalli,
Pavel A. Pevzner:
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals.
STOC 1995: 178-189 |
4 | | Sridhar Hannenhalli,
Pavel A. Pevzner:
Towards a Computational Theory of Genome Rearrangements.
Computer Science Today 1995: 184-202 |
1993 |
3 | | Sridhar Hannenhalli,
Kalyan S. Perumalla,
N. Chandrasekharan,
R. Sridhar:
A Distributed Algorithm for Ear Decomposition.
ICCI 1993: 180-184 |
1992 |
2 | | N. Chandrasekharan,
Sridhar Hannenhalli:
Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs.
ICCI 1992: 42-45 |
1991 |
1 | EE | Kien A. Hua,
Sridhar Hannenhalli:
Parallel Transitive Closure Computations Using Topological Sort.
PDIS 1991: 122-129 |