|
Search the dblp DataBase
Sridhar Hannenhalli:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Kien A. Hua, Sridhar Hannenhalli
Parallel Transitive Closure Computations Using Topological Sort. [Citation Graph (3, 0)][DBLP] PDIS, 1991, pp:122-129 [Conf]
- Piotr Berman, Sridhar Hannenhalli
Fast Sorting by Reversal. [Citation Graph (0, 0)][DBLP] CPM, 1996, pp:168-185 [Conf]
- Sridhar Hannenhalli
Polynomial-time Algorithm for Computing Translocation Distance between Genomes. [Citation Graph (0, 0)][DBLP] CPM, 1995, pp:162-176 [Conf]
- Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
1.375-Approximation Algorithm for Sorting by Reversals. [Citation Graph (0, 0)][DBLP] ESA, 2002, pp:200-210 [Conf]
- Sridhar Hannenhalli, Pavel A. Pevzner
Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem). [Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:581-592 [Conf]
- N. Chandrasekharan, Sridhar Hannenhalli
Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP] ICCI, 1992, pp:42-45 [Conf]
- Sridhar Hannenhalli, Kalyan S. Perumalla, N. Chandrasekharan, R. Sridhar
A Distributed Algorithm for Ear Decomposition. [Citation Graph (0, 0)][DBLP] ICCI, 1993, pp:180-184 [Conf]
- Sridhar Hannenhalli, Samuel Levy
Promoter prediction in the human genome. [Citation Graph (0, 0)][DBLP] ISMB (Supplement of Bioinformatics), 2001, pp:90-96 [Conf]
- Sridhar Hannenhalli, Li-San Wang
Enhanced position weight matrices using mixture models. [Citation Graph (0, 0)][DBLP] ISMB (Supplement of Bioinformatics), 2005, pp:204-212 [Conf]
- Logan Everett, Li-San Wang, Sridhar Hannenhalli
Dense subgraph computation via stochastic search: application to detect transcriptional modules. [Citation Graph (0, 0)][DBLP] ISMB (Supplement of Bioinformatics), 2006, pp:117-123 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] RECOMB, 1997, pp:1-2 [Conf]
- Perry Evans, Greg Donahue, Sridhar Hannenhalli
Conservation Patterns in cis-Elements Reveal Compensatory Mutations. [Citation Graph (0, 0)][DBLP] Comparative Genomics, 2006, pp:186-199 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] SODA, 1997, pp:390-399 [Conf]
- Sridhar Hannenhalli, Pavel A. Pevzner
To Cut... or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution). [Citation Graph (0, 0)][DBLP] SODA, 1996, pp:304-313 [Conf]
- Sridhar Hannenhalli, Pavel A. Pevzner
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. [Citation Graph (0, 0)][DBLP] STOC, 1995, pp:178-189 [Conf]
- Sridhar Hannenhalli, W. Feldman, H. F. Lewis, Steven Skiena, Pavel A. Pevzner
Positional sequencing by hybridization. [Citation Graph (0, 0)][DBLP] Computer Applications in the Biosciences, 1996, v:12, n:1, pp:19-24 [Journal]
- Samuel Levy, Sridhar Hannenhalli, Christopher T. Workman
Enrichment of regulatory signals in conserved non-coding genomic sequence. [Citation Graph (0, 0)][DBLP] Bioinformatics, 2001, v:17, n:10, pp:871-877 [Journal]
- Junwen Wang, Sridhar Hannenhalli
Generalizations of Markov model to characterize biological sequences. [Citation Graph (0, 0)][DBLP] BMC Bioinformatics, 2005, v:6, n:, pp:219- [Journal]
- Sridhar Hannenhalli
Polynomial-time Algorithm for Computing Translocation Distance Between Genomes. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:137-151 [Journal]
- Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
1.375-Approximation Algorithm for Sorting by Reversals [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:47, pp:- [Journal]
- Sridhar Hannenhalli, Pavel A. Pevzner
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP] J. ACM, 1999, v:46, n:1, pp:1-27 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 1997, v:4, n:3, pp:275-296 [Journal]
- Vineet Bafna, Dan Gusfield, Sridhar Hannenhalli, Shibu Yooseph
A Note on Efficient Computation of Haplotypes via Perfect Phylogeny. [Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2004, v:11, n:5, pp:858-866 [Journal]
- Vineet Bafna, Sridhar Hannenhalli, Ken Rice, Lisa Vawter
Ligand-Receptor Pairing Via Tree Comparison. [Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2000, v:7, n:1-2, pp:59-70 [Journal]
- Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan
Hardness of Flip-Cut Problems from Optical Mapping. [Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 1997, v:4, n:2, pp:119-126 [Journal]
- Li-San Wang, Shane T. Jensen, Sridhar Hannenhalli
An Interaction-Dependent Model for Transcription Factor Binding. [Citation Graph (0, 0)][DBLP] Systems Biology and Regulatory Genomics, 2005, pp:225-234 [Conf]
Mimosa: Mixture Model of Co-expression to Detect Modulators of Regulatory Interaction. [Citation Graph (, )][DBLP]
Eukaryotic transcription factor binding sites - modeling and integrative search methods. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.322secs
|