Giri Narasimhan - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Invited: Comparative microbial genomicsGiri Narasimhan. iccabs 2011: 8 [doi]

CloG: A pipeline for closing gaps in a draft assembly using short readsXing Yang, Daniel Medvin, Giri Narasimhan, Deborah Yoder-Himes, Stephen Lory. iccabs 2011: 202-207 [doi]

2010

Guest Editors Introduction to the Special Section on Bioinformatics Research and ApplicationsIon Mandou, Giri Narasimhan, Yi Pan, Yanqing Zhang. tcbb, 7(4):577-578, 2010. [doi]

Clustering Genes Using Heterogeneous Data SourcesErliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan. ijkdb, 1(2):12-28, 2010. [doi]

2009

Weighted Consensus Clustering for Identifying Functional Modules in Protein-Protein Interaction NetworksYi Zhang 0005, Erliang Zeng, Tao Li, Giri Narasimhan. icmla 2009: 539-544 [doi]

Region-restricted clustering for geographic data miningJoachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan. comgeo, 42(3):231-240, 2009. [doi]

On the dilation spectrum of paths, cycles, and treesRolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid. comgeo, 42(9):923-933, 2009. [doi]

Bioinformatics Research and Applications, 5th International Symposium, ISBRA 2009, Fort Lauderdale, FL, USA, May 13-16, 2009, ProceedingsIon I. Mandoiu, Giri Narasimhan, Yanqing Zhang, editors, Volume 5542 of Lecture Notes in Computer Science, Springer, 2009. [doi]

2008

2007

CyberBridges A Model Collaboration Infrastructure for e-ScienceHeidi L. Alvarez, David C. Chatfield, Donald A. Cox, Eric Crumpler, Cassian D Cunha, Ronald Gutierrez, Julio Ibarra, Eric Johnson, Kuldeep Kumar, Tom Milledge, Giri Narasimhan, Seyed Masoud Sadjadi, Chi Zhang. ccgrid 2007: 65-72 [doi]

Searching for Recombinant Donors in a Phylogenetic Network of Serial SamplesPatricia Buendia, Giri Narasimhan. isbra 2007: 109-120 [doi]

Sliding MinPD: building evolutionary networks of serial samples via an automated recombination detection approachPatricia Buendia, Giri Narasimhan. bioinformatics, 23(22):2993-3000, 2007. [doi]

Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff, editors, Volume 06481 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.

Distance-preserving approximations of polygonal pathsJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid. comgeo, 36(3):183-196, 2007. [doi]

SBLAST: Structural Basic Local Alignment Searching Tools using Geometric HashingTom Milledge, Gaolin Zheng, Tim Mullins, Giri Narasimhan. bibe 2007: 1343-1347 [doi]

Geometric spanner networksGiri Narasimhan, Michiel H. M. Smid. Cambridge University Press, 2007.

A Graph Reduction Method for 2D Snake ProblemsJianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching Chen, Giri Narasimhan. cvpr 2007: [doi]

On the Effectiveness of Constraints Sets in Clustering GenesErliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan. bibe 2007: 79-86 [doi]

Enhancing Motif Refinement by Incorporating Comparative Genomics DataErliang Zeng, Giri Narasimhan. isbra 2007: 329-337 [doi]

2006

Serial NetEvolve: a flexible utility for generating serially-sampled sequences along a tree or recombinant networkPatricia Buendia, Giri Narasimhan. bioinformatics, 22(18):2313-2314, 2006. [doi]

Reconstructing Ancestor-Descendant Lineages from Serially-Sampled Data: A Comparison StudyPatricia Buendia, Timothy M. Collins, Giri Narasimhan. iccS 2006: 807-814 [doi]

06481 Abstracts Collection - Geometric Networks and Metric Space EmbeddingsJoachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff. dagstuhl 2007: [doi]

Region-Restricted Clustering for Geographic Data MiningJoachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan. esa 2006: 399-410 [doi]

Discovering Sequence-Structure Patterns in Proteins with Variable Secondary StructureTom Milledge, Gaolin Zheng, Giri Narasimhan. iccS 2006: 702-709 [doi]

Mining the Database of Transcription Binding SitesWei Peng, Tao Li, Giri Narasimhan. bibe 2006: 61-64

Pooling Evidence to Identify Cell Cycle-Regulated GenesGaolin Zheng, Tom Milledge, E. Olusegun George, Giri Narasimhan. iccS 2006: 694-701 [doi]

2005

2004

Approximating geometric bottleneck shortest pathsProsenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. comgeo, 29(3):233-249, 2004. [doi]

MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV QuasispeciesPatricia Buendia, Giri Narasimhan. csb 2004: 110-119 [doi]

2003

2002

Balanced Partition of Minimum Spanning TreesMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan. iccS 2002: 26-35 [doi]

Optimally computing a shortest weakly visible line segment inside a simple polygonBinay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan. comgeo, 23(1):1-29, 2002.

Approximate Distance Oracles RevisitedJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. isaac 2002: 357-368 [doi]

Fast Greedy Algorithms for Constructing Sparse Geometric SpannersJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan. siamcomp, 31(5):1479-1500, 2002. [doi]

Approximate distance oracles for geometric graphsJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. soda 2002: 828-837 [doi]

Improved Algorithms for Constructing Fault-Tolerant SpannersChristos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. algorithmica, 32(1):144-156, 2002. [doi]

Mining Protein Sequences for MotifsGiri Narasimhan, Changsong Bu, Yuan Gao, Xuning Wang, Ning Xu, Kalai Mathee. jcb, 9(5):707-720, 2002.

Approximation Algorithms for the Bottleneck Stretch Factor ProblemGiri Narasimhan, Michiel H. M. Smid. njc, 9(1):13-31, 2002.

2001

2000

Improved Greedy Algorithms for Constructing Sparse Geometric SpannersJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan. swat 2000: 314-327 [doi]

Approximating the Stretch Factor of Euclidean GraphsGiri Narasimhan, Michiel H. M. Smid. siamcomp, 30(3):978-989, 2000. [doi]

1999

Motif Detection in Protein SequencesYuan Gao, Kalai Mathee, Giri Narasimhan, Xuning Wang. spire 1999: 63-72 [doi]

Approximating Minimum Manhattan NetworksJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan. random 1999: 28-38

On Hamiltonian Triangulations in Simple PolygonsGiri Narasimhan. ijcga, 9(3):261-275, 1999.

1998

Resource-Constrained Geometric Network OptimizationEsther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan. compgeom 1998: 307-316 [doi]

Information capacity of binary weights associative memoriesArun K. Jagota, Giri Narasimhan, Kenneth W. Regan. ijon, 19(1-3):35-58, 1998. [doi]

Efficient Algorithms for Constructing Fault-Tolerant Geometric SpannersChristos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. stoc 1998: 186-195 [doi]

1997

A Fast Algorithm for Constructing Sparse Euclidean SpannersGautam Das, Giri Narasimhan. ijcga, 7(4):297-315, 1997.

LR-visibility in PolygonsGautam Das, Paul J. Heffernan, Giri Narasimhan. comgeo, 7:37-57, 1997.

On Hamiltonian Triangulations in Simple Polygons (Extended Abstract)Giri Narasimhan. wads 1997: 321-330

1995

New sparseness results on graph spannersBarun Chandra, Gautam Das, Giri Narasimhan, José Soares. ijcga, 5:125-144, 1995.

A New Way to Weigh Malnourished Euclidean GraphsGautam Das, Giri Narasimhan, Jeffrey S. Salowe. soda 1995: 215-222

1994

1993

LR-visibility in PolygonsGautam Das, Paul J. Heffernan, Giri Narasimhan. cccg 1993: 303-308

Optimally Sparse Spanners in 3-Dimensional Euclidean SpaceGautam Das, Paul J. Heffernan, Giri Narasimhan. compgeom 1993: 53-62 [doi]

1992

New Sparseness Results on Graph SpannersBarun Chandra, Gautam Das, Giri Narasimhan, José Soares. compgeom 1992: 192-201 [doi]

Stability number and chromatic number of tolerance graphsGiri Narasimhan, Rachel Manber. DAM, 36(1):47-56, 1992. [doi]

1991

Geometric Searching and Link Distance (Extended Abstract)Gautam Das, Giri Narasimhan. wads 1991: 261-272

1989

A Note on the Hamiltonian Circuit Problem on Directed Path GraphsGiri Narasimhan. ipl, 32(4):167-170, 1989.