Allele-specific primer based identification of dimeric alpha-amylase inhibitor

Wheat is one of the most important staple food crops cultivated over 200 mha in the range of environment throughout the world. Wheat production must continue to increase by 2% annually, more particularly in developing world including south-east Asia. Besides increasing the inherent productivity of wheat, it is important to minimize the losses caused to production by various abiotic and biotic factors. Alpha–amylase inhibitors are attractive candidates for the control of seed weevils as these insects are highly dependent on starch as the energy source. They play an important role in the carbohydrate metabolism of many heterotrophic and autotrophic organisms. In this study, we aimed to make sequence comparison and phylogenetic relationship among dimeric alpha-amylase inhibitor genes. These genes were clustered into two major groups based on phylogenetic analysis. Multiple alignments show at least 24 candidates single nucleotide polymorphisms in inhibitor genes, which could further be exploited for SNPs based haplotype diversity among Indian released wheat genotype. We have detected dimeric alpha-amylase inhibitor genes in cultivated and wild ancestors of wheat using genome specific primers. Genes encoding dimeric alpha-amylase belong to the family of 24 kDa alpha-amylase inhibitors. In this study, specific primer pairs were designed based on SNPs of these genes and chromosome locations of inhibitor genes confirmed by amplification in accession of T. urartu, A. tauschii, and A. speltoides. Results obtained under this study support that inhibitor genes amplified with primer PSWDAIAF1/PSWDAIAF2 and PSWDAIBF1/PSWDAIBF2 is present on genome B. These results further support evidence at molecular level that dimeric alpha-amylase inhibitor in cultivated wheat is encoded by a multigene family.

&#xa

Fractional Integration and Fractional Differentiation of the M-Series

Mathematics Subject Classification: 26A33, 33C60, 44A15In this paper a new special function called as M-series is introduced. This series is a particular case of the H-function of Inayat-Hussain. The M-series is interesting because the pFq -hypergeometric function and the Mittag-Leffler function follow as its particular cases, and these functions have recently found essential applications in solving problems in physics, biology, engineering and applied sciences. Let us note that the Mittag-Leffler function occurs as solution of fractional integral equations in those area. In this short note we have obtained formulas for the fractional integral and fractional derivative of the M-series

Experience of Developing a Meta-Semantic Search Engine

Thinking of todays web search scenario which is mainly keyword based, leads to the need of effective and meaningful search provided by Semantic Web. Existing search engines are vulnerable to provide relevant answers to users query due to their dependency on simple data available in web pages. On other hand, semantic search engines provide efficient and relevant results as the semantic web manages information with well defined meaning using ontology. A Meta-Search engine is a search tool that forwards users query to several existing search engines and provides combined results by using their own page ranking algorithm. SemanTelli is a meta semantic search engine that fetches results from different semantic search engines such as Hakia, DuckDuckGo, SenseBot through intelligent agents. This paper proposes enhancement of SemanTelli with improved snippet analysis based page ranking algorithm and support for image and news search.Comment: 4 pages, 9 figures, 1 table. CUBE 2013 International Conferenc

Private Data Transfer over a Broadcast Channel

We study the following private data transfer problem: Alice has a database of files. Bob and Cathy want to access a file each from this database (which may or may not be the same file), but each of them wants to ensure that their choices of file do not get revealed even if Alice colludes with the other user. Alice, on the other hand, wants to make sure that each of Bob and Cathy does not learn any more information from the database than the files they demand (the identities of which will be unknown to her). Moreover, they should not learn any information about the other files even if they collude. It turns out that it is impossible to accomplish this if Alice, Bob, and Cathy have access only to private randomness and noiseless communication links. We consider this problem when a binary erasure broadcast channel with independent erasures is available from Alice to Bob and Cathy in addition to a noiseless public discussion channel. We study the file-length-per-broadcast-channel-use rate in the honest-but-curious model. We focus on the case when the database consists of two files, and obtain the optimal rate. We then extend to the case of larger databases, and give upper and lower bounds on the optimal rate.Comment: To be presented at IEEE International Symposium on Information Theory (ISIT 2015), Hong Kon