( en | de | ru )

 

Disambiguation of "Narayanan, Manikandan"

Author of the publication

copydeleteadd this publication to your clipboard
Simultaneous Clustering of Multiple Gene Expression and Physical Interaction Datasets.

, , , and . PLoS Comput. Biol., (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Palanichamy Manikandan

P Narayanan

Hermine Narayanan

Vidya Narayanan

Narayanan Radhakrishnan

 

Other publications of authors with the same name

Hybrid Electro Search with Ant Colony Optimization Algorithm for Task Scheduling in a Sensor Cloud Environment for Agriculture Irrigation Control System., , , , , and . Complex., (2022)Gapped Local Similarity Search with Provable Guarantees., and . WABI, volume 3240 of Lecture Notes in Computer Science, page 74-86. Springer, (2004)Parallel data processing approaches for effective intensive care units with internet of things., and . Int. J. Comput. Sci. Eng., 19 (4): 474-482 (2019)Using Signal Processing in Tandem With Adapted Mixture Models for Classifying Genomic Signals., , , and . CoRR, (2022)Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube., , , and . CoRR, (2021)A Cluster-Based Energy-Efficient Secure Optimal Path-Routing Protocol for Wireless Body-Area Sensor Networks., , , , , , , , and . Sensors, 23 (14): 6274 (July 2023)Performance Evaluation of Two Emerging Media Processors: VIRAM and Imagine., , , and . IPDPS, page 229. IEEE Computer Society, (2003)The Complexity of the Simultaneous Cluster Problem., , and . J. Graph Algorithms Appl., 18 (1): 1-34 (2014)Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm., and . J. Comput. Biol., 14 (7): 892-907 (2007)Predicting cross-tissue hormone-gene relations using balanced word embeddings., , , , and . Bioinform., 38 (20): 4771-4781 (October 2022)