Akshay Deepak

Learn More
Comprehensively sampled phylogenetic trees provide the most compelling foundations for strong inferences in comparative evolutionary biology. Mismatches are common, however, between the taxa for which comparative data are available and the taxa sampled by published phylogenetic analyses. Moreover, many published phylogenies are gene trees, which cannot(More)
A multi-labeled tree, or MUL-tree, is a phylogenetic tree where two or more leaves share a label, e.g., a species name. A MUL-tree can imply multiple conflicting phylogenetic relationships for the same set of taxa, but can also contain conflict-free information that is of interest and yet is not obvious. We define the information content of a MUL-tree T as(More)
The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to interpret the results of phylogenetic analysis. FST mining generalizes the well-known maximum agreement subtree problem. Here we present EvoMiner, a new algorithm for mining frequent subtrees in collections of phylogenetic(More)
Linked data indicate a manner of publishing and interlinking structured data on the web. The basic hypothesis behind the concept of linked data is that the value and importance of data increases more when it is interlinked with different data sources. This interlinked web of data is termed as the Linked data. Searching data and providing the most relevant(More)
—Automated static analysis tools are widely used in identifying software anomalies, such as memory leak, unsafe thread synchronization and malicious behaviors in smartphone applications. Such anomaly-prone scenarios can be bifurcated into: " ordinary " (analysis requires relatively simple automation) and " complex " (analysis poses extraordinary automation(More)
A common problem in phylogenetic analysis is to identify frequent patterns in a collection of phylogenetic trees. The goal is, roughly, to find a subset of the species (taxa) on which all or some significant subset of the trees agree. One popular method to do so is through maximum agreement subtrees (MASTs). MASTs are also used, among other things, as a(More)
This peer-reviewed article can be downloaded, printed and distributed freely for any purposes (see copyright notice below). Articles in Algorithms for Molecular Biology are listed in PubMed and archived at PubMed Central. which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract(More)