Papers published on a yearly basis
Papers
More filters
••
TL;DR: An algorithm for detecting CNVs, which is based on depth of coverage data generated by NGS technology, and considers the read count data to follow two different distribution models independently, which adds to the robustness of detection of CNVs.
Abstract: Copy number variation (CNV) is a form of structural alteration in the mammalian DNA sequence, which are associated with many complex neurological diseases as well as cancer. The development of next generation sequencing (NGS) technology provides us a new dimension towards detection of genomic locations with copy number variations. Here we develop an algorithm for detecting CNVs, which is based on depth of coverage data generated by NGS technology. In this work, we have used a novel way to represent the read count data as a two dimensional geometrical point. A key aspect of detecting the regions with CNVs, is to devise a proper segmentation algorithm that will distinguish the genomic locations having a significant difference in read count data. We have designed a new segmentation approach in this context, using convex hull algorithm on the geometrical representation of read count data. To our knowledge, most algorithms have used a single distribution model of read count data, but here in our approach, we have considered the read count data to follow two different distribution models independently, which adds to the robustness of detection of CNVs. In addition, our algorithm calls CNVs based on the multiple sample analysis approach resulting in a low false discovery rate with high precision.
9 citations
••
04 May 2015
TL;DR: A scheme for developing a coherent global view of the post-disaster situation using local situational information in a smart-phone based delay tolerant peer-to-peer network environment and a concept of “opportunistic knowledge injection” to disseminate local situational knowledge to other remote areas without significant network overhead is proposed.
Abstract: Situational awareness is a critical component in a post-disaster recovery operation for assessment of needs and identification of available resources at different parts of a disaster-affected area. This information, in turn, may help the relief agencies to appropriately coordinate, manage and channelize their resources. A major hindrance in developing such global situational awareness is the non-uniform interaction pattern of relief workers. Volunteers in a particular region have much better knowledge of the local situation than those belonging to regions further away. This information asymmetry leads to deviation in perceptions of volunteers working in different regions, thereby affecting the resource distribution process. Thus, a unified global situational view of the entire disaster affected area is essential to bridge the perception gap of volunteers and to help them develop a common understanding of the actual scenario. In this paper, we propose a scheme for developing such a coherent global view of the post-disaster situation using local situational information in a smart-phone based delay tolerant peer-to-peer network environment.We focus on generating a comprehensive view which is consistent for all workers irrespective of their location or mobility. The proposed scheme takes into account the spatial locality and spatial regularity properties of human mobility and uses a concept of “opportunistic knowledge injection” to disseminate local situational knowledge to other remote areas without significant network overhead. The effectiveness of the proposal is evaluated on the ONE simulator.
9 citations
••
TL;DR: In this article, the authors studied broadcasting of entanglement using state dependent quantum cloning machine as a local copier and showed that there exists local state dependent cloner which gives better quality copy (in terms of average fidelity) of an entangled pair than the local universal cloner.
Abstract: Suppose we are given an entangled pair and then one can ask how well we can produce two entangled pairs starting from a given entangled pair using only local operations. To give response of the above asked question, we study broadcasting of entanglement using state dependent quantum cloning machine as a local copier. We show that the length of the interval for probability-amplitude-squared for broadcasting of entanglement using state dependent cloner can be made larger than the length of the interval for probability-amplitude-squared for broadcasting entanglement using state independent cloner. Further we show that there exists local state dependent cloner which gives better quality copy (in terms of average fidelity) of an entangled pair than the local universal cloner.
9 citations
••
TL;DR: A 43kDa α-amylase was purified from Tinospora cordifolia by glycogen precipitation, ammonium sulfate precipitation, gel filtration chromatography, and HPGPLC and released maltose as the major end product.
9 citations
••
TL;DR: An improved audio steganography approach that reduces distortion of the stego audio and using the proposed algorithm, secret information is strongly protected from hackers and sent to its destination in a safe manner.
Abstract: Information hiding and secret communication is one of the most interesting and fascinating domains. This hiding method exploits some features of audio signals to be able to hide data from perception robustly. Every year researchers introduce their work and discuss how to make these techniques more and more robust against different types of attacks. In this article, we present an improved audio steganography approach that reduces distortion of the stego audio. Using the proposed algorithm, secret information is strongly protected from hackers and sent to its destination in a safe manner.
9 citations
Authors
Showing all 581 results
Name | H-index | Papers | Citations |
---|---|---|---|
Debnath Bhattacharyya | 39 | 578 | 6867 |
Samiran Mitra | 38 | 198 | 5108 |
Dipankar Chakravorty | 35 | 369 | 5288 |
S. Saha Ray | 34 | 217 | 3888 |
Tai-hoon Kim | 33 | 526 | 4974 |
Anindya Sen | 29 | 109 | 3472 |
Ujjal Debnath | 29 | 335 | 3828 |
Anirban Mukhopadhyay | 29 | 169 | 3200 |
Avijit Ghosh | 28 | 121 | 2639 |
Mrinal K. Ghosh | 26 | 64 | 2243 |
Biswanath Bhunia | 23 | 75 | 1466 |
Jayati Datta | 23 | 55 | 1520 |
Nabarun Bhattacharyya | 23 | 136 | 1960 |
Pinaki Bhattacharya | 19 | 114 | 1193 |
Dwaipayan Sen | 18 | 71 | 1086 |