Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Nishanth Ulhas Nair

dblp:52/8061 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2014
0000-0002-8832-0329ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 3 first-authorArtificial intelligence and machine learning · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › epigenomics
ChIP-seq analysis
0.212014
Probabilistic partitioning methods to find significant patterns in ChIP-Seq data · Bioinform. 2014
Bioinformatics and computational biology › sequence analysis › motif discovery
pattern discovery
0.212014
Probabilistic partitioning methods to find significant patterns in ChIP-Seq data · Bioinform. 2014
Bioinformatics and computational biology › epigenomics › ChIP-seq analysis
peak detection
0.212014
Probabilistic partitioning methods to find significant patterns in ChIP-Seq data · Bioinform. 2014

Methods — techniques the papers use, named apart from their topics

probabilistic partitioning · 0.2
YearPublicationVenuePosition
2014 Probabilistic partitioning methods to find significant patterns in ChIP-Seq data
abstract
MOTIVATION: We have witnessed an enormous increase in ChIP-Seq data for histone modifications in the past few years. Discovering significant patterns in these data is an important problem for understanding biological mechanisms. RESULTS: We propose probabilistic partitioning methods to discover significant patterns in ChIP-Seq data. Our methods take into account signal magnitude, shape, strand orientation and shifts. We compare our methods with some current methods and demonstrate significant improvements, especially with sparse data. Besides pattern discovery and classification, probabilistic partitioning can serve other purposes in ChIP-Seq data analysis. Specifically, we exemplify its merits in the context of peak finding and partitioning of nucleosome positioning patterns in human promoters. AVAILABILITY AND IMPLEMENTATION: The software and code are available in the supplementary material. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Nishanth Ulhas Nair, Bernard M. E. Moret, Philipp Bucher
Bioinform.1
2014 Study of cell differentiation by phylogenetic analysis using histone modification data
abstract
BACKGROUND: In cell differentiation, a cell of a less specialized type becomes one of a more specialized type, even though all cells have the same genome. Transcription factors and epigenetic marks like histone modifications can play a significant role in the differentiation process. RESULTS: In this paper, we present a simple analysis of cell types and differentiation paths using phylogenetic inference based on ChIP-Seq histone modification data. We precisely defined the notion of cell-type trees and provided a procedure of building such trees. We propose new data representation techniques and distance measures for ChIP-Seq data and use these together with standard phylogenetic inference methods to build biologically meaningful cell-type trees that indicate how diverse types of cells are related. We demonstrate our approach on various kinds of histone modifications for various cell types, also using the datasets to explore various issues surrounding replicate data, variability between cells of the same type, and robustness. We use the results to get some interesting biological findings like important patterns of histone modification changes during cell differentiation process. CONCLUSIONS: We introduced and studied the novel problem of inferring cell type trees from histone modification data. The promising results we obtain point the way to a new approach to the study of cell differentiation. We also discuss how cell-type trees can be used to study the evolution of cell types.
Nishanth Ulhas Nair, Yu Lin 0001, Ana Manasovska, Jelena Antic, Paulina Grnarova, Avinash Das Sahu, Philipp Bucher, Bernard M. E. Moret
BMC Bioinform.1
2013 Phylogenetic Analysis of Cell Types Using Histone Modifications
Nishanth Ulhas Nair, Yu Lin 0001, Philipp Bucher, Bernard M. E. Moret
WABI1
2010 Joint evaluation of multiple speech patterns for speech recognition and training
Nishanth Ulhas Nair, Thippur V. Sreenivas
Comput. Speech Lang.1
2010 Multi-Pattern Viterbi Algorithm for joint decoding of multiple speech patterns
Nishanth Ulhas Nair, Thippur V. Sreenivas
Signal Process.1
2009 A joint decoding algorithm for multiple-example-based addition of words to a pronunciation lexicon
abstract
We propose an algorithm that enables joint Viterbi decoding of multiple independent audio recordings of a word to derive its pronunciation. Experiments show that this method results in better pronunciation estimation and word recognition accuracy than that obtained either with a single example of the word or using conventional approaches to pronunciation estimation using multiple examples.
Dhananjay Bansal, Nishanth Ulhas Nair, Rita Singh, Bhiksha Raj
ICASSP2
2007 Joint decoding of multiple speech patterns for robust speech recognition
abstract
We are addressing a new problem of improving automatic speech recognition performance, given multiple utterances of patterns from the same class. We have formulated the problem of jointly decoding K multiple patterns given a single Hidden Markov Model. It is shown that such a solution is possible by aligning the K patterns using the proposed Multi Pattern Dynamic Time Warping algorithm followed by the Constrained Multi Pattern Viterbi Algorithm. The new formulation is tested in the context of speaker independent isolated word recognition for both clean and noisy patterns. When 10 percent of speech is affected by a burst noise at −5 dB Signal to Noise Ratio (local), it is shown that joint decoding using only two noisy patterns reduces the noisy speech recognition error rate to about 51 percent, when compared to the single pattern decoding using the Viterbi Algorithm. In contrast a simple maximization of individual pattern likelihoods, provides only about 7 percent reduction in error rate.
Nishanth Ulhas Nair, Thippur V. Sreenivas
ASRU1