Sitharama S. Iyengar

Functionally important segments in proteins dissected using Gene Ontology and geometric clustering of peptide fragments (2008)

Manikandan, Karuppasamy, Pal, Debnath, Ramakumar, Suryanarayanarao, Brener, Nathan E, Iyengar, Sitharama S, Seetharaman, Guna

Abstract We have developed a geometric clustering algorithm using backbone φ,ψ angles to group conformationally similar peptide fragments of any length. By labeling each fragment in the cluster...

Functionally important segments in proteins dissected using Gene Ontology and geometric clustering of peptide fragments (2008)

Manikandan, Karuppasamy, Pal, Debnath, Ramakumar, Suryanarayanarao, Brener, Nathan E, Iyengar, Sitharama S, Seetharaman, Guna

We have developed a geometric clustering algorithm using backbone \varphi,\psi angles to group conformationally similar peptide fragments of any length. By labeling each fragment in the cluster with...

Functionally important segments in proteins dissected using Gene Ontology and geometric clustering of peptide fragments (2008)

Manikandan, Karuppasamy, Pal, Debnath, Ramakumar, Suryanarayanarao, Brener, Nathan E, Iyengar, Sitharama S, Seetharaman, Guna

We have developed a geometric clustering algorithm using backbone \varphi,\psi angles to group conformationally similar peptide fragments of any length. By labeling each fragment in the cluster with...

Three-dimensional route planning for large grids (2004)

Brener, Nathan E, Iyengar, Sitharama S, Looney, Hua C, Vakamudi, Narayanadas, Yu, Decai, Huang, Qianyu, ...

We have developed a 3D route planner, called 3DPLAN, which employs the A* algorithm to find optimum paths. The A* algorithm has a major advantage compared to other search methods because it is...

Three-dimensional route planning for large grids (2004)

Brener, Nathan E, Iyengar, Sitharama S, Looney, Hua C, Vakamudi, Narayanadas, Yu, Decai, Huang, Qianyu, ...

We have developed a 3D route planner, called 3DPLAN, which employs the A* algorithm to find optimum paths. The A* algorithm has a major advantage compared to other search methods because it is...

Coding theory framework for target location in distributed sensor networks (2001)

Krishnendu Chakrabarty, Sitharama S. Iyengar, Hairong Qi, Eungchun Cho

Distribiited9 red-time setisor nenvorks ure essential jor eflective surveillance in the digitized bcittlejwld arid for etivironnientul nioriitoririg. [ti this paper; ~ve present the,first systematic...

Coding theory framework for target location in distributed sensor networks (2001)

Krishnendu Chakrabarty, Sitharama S. Iyengar, Hairong Qi, Eungchun Cho

Distributed, real-time sensor networks are essential for effective surveillance in the digitized battlefield and for environmental monitoring. In this paper, we present the first systematic theory...

Coding Theory Framework for Target Location in Distributed Sensor Networks (2001)

Krishnendu Chakrabarty Sitharama, Krishnendu Chakrabarty, Sitharama S. Iyengar, Hairong Qi, Eungchun Cho

effective surveillance in the digitized battlefield and for environmental monitoring. In this paper, we present the first systematic theory that leads to novel sensor deployment strategies for...

and (1996)

Nitin S. Naik, Sitharama S. Iyengar

Computer communication demands for higher bandwidth and smaller delays are increasing rapidly as the march into the twenty-first century gains momentum. These demands are generated by visualization...