Cascade PSI-BLAST web server: a remote homology search tool for relating protein domains

Owing to high evolutionary divergence, it is not always possible to identify distantly related protein domains by sequence search techniques. Intermediate sequences possess sequence features of more than one protein and facilitate detection of remotely related proteins. We have demonstrated recently the employment of Cascade PSI-BLAST where we perform PSI-BLAST for many 'generations', initiating searches from new homologues as well. Such a rigorous propagation through generations of PSI-BLAST employs effectively the role of intermediates in detecting distant similarities between proteins. This approach has been tested on a large number of folds and its performance in detecting superfamily level relationships is similar to 35% better than simple PSI-BLAST searches. We present a web server for this search method that permits users to perform Cascade PSI-BLAST searches against the Pfam, SCOP and SwissProt databases. The URL for this server is http://crick.mbu.iisc.ernet.in/similar to CASCADE/CascadeBlast.html.

Federated Search Service for OAI-compliant, Open-Access Repositories in India

Many of the research institutions and universities across the world are facilitating open-access (OA) to their intellectual outputs through their respective OA institutional repositories (IRs) or through the centralized subject-based repositories. The registry of open access repositories (ROAR) lists more than 2850 such repositories across the world. The awareness about the benefits of OA to scholarly literature and OA publishing is picking up in India, too. As per the ROAR statistics, to date, there are more than 90 OA repositories in the country. India is doing particularly well in publishing open-access journals (OAJ). As per the directory of open-access journals (DOAJ), to date, India with 390 OAJs, is ranked 5th in the world in terms of numbers of OAJs being published. Much of the research done in India is reported in the journals published from India. These journals have limited readership and many of them are not being indexed by Web of Science, Scopus or other leading international abstracting and indexing databases. Consequently, research done in the country gets hidden not only from the fellow countrymen, but also from the international community. This situation can be easily overcome if all the researchers facilitate OA to their publications. One of the easiest ways to facilitate OA to scientific literature is through the institutional repositories. If every research institution and university in India set up an open-access IR and ensure that copies of the final accepted versions of all the research publications are uploaded in the IRs, then the research done in India will get far better visibility. The federation of metadata from all the distributed, interoperable OA repositories in the country will serve as a window to the research done across the country. Federation of metadata from the distributed OAI-compliant repositories can be easily achieved by setting up harvesting software like the PKP Harvester. In this paper, we share our experience in setting up a prototype metadata harvesting service using the PKP harvesting software for the OAI-compliant repositories in India.

a backtracking search tool for constructing combinatorial test suites

Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool.

On Understanding How Developers Use the Spotter Search Tool

Analyzing how software engineers use the Integrated Development Environment (IDE) is essential to better understanding how engineers carry out their daily tasks. Spotter is a code search engine for the Pharo programming language. Since its inception, Spotter has been rapidly and broadly adopted within the Pharo community. However, little is known about how practitioners employ Spotter to search and navigate within the Pharo code base. This paper evaluates how software engineers use Spotter in practice. To achieve this, we remotely gather user actions called events. These events are then visually rendered using an adequate navigation tool chain. Sequences of events are represented using a visual alphabet. We found a number of usage patterns and identified underused Spotter features. Such findings are essential for improving Spotter.

InfoScout: An interactive, entity centric, person search tool.

Individuals living in highly networked societies publish a large amount of personal, and potentially sensitive, information online. Web investigators can exploit such information for a variety of purposes, such as in background vetting and fraud detection. However, such investigations require a large number of expensive man hours and human effort. This paper describes InfoScout, a search tool which is intended to reduce the time it takes to identify and gather subject centric information on the Web. InfoScout collects relevance feedback information from the investigator in order to rerank search results, allowing the intended information to be discovered more quickly. Users may still direct their search as they see fit, issuing ad-hoc queries and filtering existing results by keywords. Design choices are informed by prior work and industry collaboration.

A Search for Energy Minimized Sequences of Proteins

In this paper, we present numerical evidence that supports the notion of minimization in the sequence space of proteins for a target conformation. We use the conformations of the real proteins in the Protein Data Bank (PDB) and present computationally efficient methods to identify the sequences with minimum energy. We use edge-weighted connectivity graph for ranking the residue sites with reduced amino acid alphabet and then use continuous optimization to obtain the energy-minimizing sequences. Our methods enable the computation of a lower bound as well as a tight upper bound for the energy of a given conformation. We validate our results by using three different inter-residue energy matrices for five proteins from protein data bank (PDB), and by comparing our energy-minimizing sequences with 80 million diverse sequences that are generated based on different considerations in each case. When we submitted some of our chosen energy-minimizing sequences to Basic Local Alignment Search Tool (BLAST), we obtained some sequences from non-redundant protein sequence database that are similar to ours with an E-value of the order of 10(-7). In summary, we conclude that proteins show a trend towards minimizing energy in the sequence space but do not seem to adopt the global energy-minimizing sequence. The reason for this could be either that the existing energy matrices are not able to accurately represent the inter-residue interactions in the context of the protein environment or that Nature does not push the optimization in the sequence space, once it is able to perform the function.

Spotter: towards a unified search interface in IDEs

Program comprehension requires developers to reason about many kinds of highly interconnected software entities. Dealing with this reality prompts developers to continuously intertwine searching and navigation. Nevertheless, most integrated development environments (IDEs) address searching by means of many disconnected search tools, making it difficult for developers to reuse search results produced by one search tool as input for another search tool. This forces developers to spend considerable time manually linking disconnected search results. To address this issue we propose Spotter, a model for expressing and combining search tools in a unified way. The current implementation shows that Spotter can unify a wide range of search tools. More information about Spotter can be found at scg.unibe.ch/research/moldablespotter

The resistance of PRESENT-80 against related-key differential attacks

We examine the security of the 64-bit lightweight block cipher PRESENT-80 against related-key differential attacks. With a computer search we are able to prove that for any related-key differential characteristic on full-round PRESENT-80, the probability of the characteristic only in the 64-bit state is not higher than 2−64. To overcome the exponential (in the state and key sizes) computational complexity of the search we use truncated differences, however as the key schedule is not nibble oriented, we switch to actual differences and apply early abort techniques to prune the tree-based search. With a new method called extended split approach we are able to make the whole search feasible and we implement and run it in real time. Our approach targets the PRESENT-80 cipher however,with small modifications can be reused for other lightweight ciphers as well.

VIP Barcoding: Composition vector-based software for rapid species identification based on DNA barcoding

Species identification based on short sequences of DNA markers, that is, DNA barcoding, has emerged as an integral part of modern taxonomy. However, software for the analysis of large and multilocus barcoding data sets is scarce. The Basic Local Alignment Search Tool (BLAST) is currently the fastest tool capable of handling large databases (e.g. >5000 sequences), but its accuracy is a concern and has been criticized for its local optimization. However, current more accurate software requires sequence alignment or complex calculations, which are time-consuming when dealing with large data sets during data preprocessing or during the search stage. Therefore, it is imperative to develop a practical program for both accurate and scalable species identification for DNA barcoding. In this context, we present VIP Barcoding: a user-friendly software in graphical user interface for rapid DNA barcoding. It adopts a hybrid, two-stage algorithm. First, an alignment-free composition vector (CV) method is utilized to reduce searching space by screening a reference database. The alignment-based K2P distance nearest-neighbour method is then employed to analyse the smaller data set generated in the first stage. In comparison with other software, we demonstrate that VIP Barcoding has (i) higher accuracy than Blastn and several alignment-free methods and (ii) higher scalability than alignment-based distance methods and character-based methods. These results suggest that this platform is able to deal with both large-scale and multilocus barcoding data with accuracy and can contribute to DNA barcoding for modern taxonomy. VIP Barcoding is free and available at http://msl.sls.cuhk.edu.hk/vipbarcoding/.

BSSB: BLAST Server for Structural Biologists

The Basic Local Alignment Search Tool (BLAST) is one of the most widely used sequence alignment programs with which similarity searches, for both protein and nucleic acid sequences, can be performed against large databases at high speed. A large number of tools exist for processing BLAST output, but none of them provide three-dimensional structure visualization. This shortcoming has been addressed in the proposed tool BLAST Server for Structural Biologists (BSSB), which maps a BLAST output onto the three-dimensional structure of the subject protein. The three-dimensional structure of the subject protein is represented using a three-color coding scheme (identical: red; similar: yellow; and mismatch: white) based on the pairwise alignment obtained. Thus, the user will be able to visualize a possible three-dimensional structure for the query protein sequence. This information can be used to gain a deeper insight into the sequence-structure correlation. Furthermore, the additional structure-level information enables the user to make coherent and logical decisions regarding the type of input model structure or fragment that can be used for molecular replacement calculations. This tool is freely available to all users at http://bioserver1.physics.iisc.ernet.in/bssb/.

A relação família-creche no programa Primeira Infância Completa

O tema central da presente dissertação está focalizado na relação família-creche. Este estudo possui, como objetivo principal, analisar como essa relação foi compreendida em três creches públicas cariocas que desenvolveram as atividades do programa Primeira Infância Completa (PIC). Tal programa fez parte das políticas públicas educacionais do município do Rio de Janeiro de 2009 a 2013. Foi direcionado a crianças de até 3 (três) anos de idade que não obtiveram matrícula regular nas creches. As atividades do PIC aconteciam aos sábados com crianças e, para as famílias, eram desenvolvidos os encontros da Escola de Pais. A pesquisa analisa os documentos oficiais (decretos, portarias, resoluções, relatórios, projetos, outras publicações internas) de criação e ampliação do programa, incluindo aqueles referentes às consultorias da UNESCO realizadas em 2012. Foi desenvolvido um levantamento bibliográfico sobre os temas família e a relação família-creche, nas bibliotecas eletrônicas SciELO e Google Acadêmico, com artigos publicados entre 2005 e 2014. A investigação empírica se deu no diálogo com alguns atores do programa, participantes das três creches municipais, totalizando 122 sujeitos, entre gestoras, professoras, agentes auxiliares de creche e familiares. As estratégias metodológicas utilizadas foram entrevistas, grupos focais e oficinas Os dados da segunda consultoria da UNESCO serviram de base para a construção das questões centrais desta pesquisa. Os resultados nos apontam que, para os sujeitos que participaram do programa, os propósitos do mesmo nem sempre foram claros. Embora tenha acontecido no espaço físico das creches (portanto, da Educação), com uma intenção intersetorial, seus objetivos tinham um forte cunho assistencial, caracterizando-o como uma modalidade alternativa de atividades para crianças e familiares. As famílias viam no programa o caminho para a conquista da vaga semanal para as suas crianças e, quando isso não acontecia, ficavam frustrados e deixavam de participar. O esforço das gestoras para a realização do programa foi sua marca de qualidade. A experiência do PIC deixou de legado para as instituições novas formas de pensar a proposta pedagógica e de lidar com as famílias, crianças e funcionários na jornada semanal

Development of expressed sequence tags from the bay scallop, Argopecten irradians irradians

The bay scallop, Argopecten irradians irradians, introduced from North America, has become one of the most important aquaculture species in China. Inan effort to identify scallop genes involved in host defense, a high-quality cDNA library was constructed from whole body tissues of the bay scallop. A total of 5828 successful sequencing reactions yielded 4995 expressed sequence tags (ESTs) longer than 100 bp. Cluster and assembly analyses of the ESTs identified 637 contigs (consisting of 2853 sequences) and 2142 singletons, totaling 2779 unique sequences. Basic Local Alignment Search Tool (BLAST) analysis showed that the majority (73%) of the unique sequences had no significant homology (E-value >= 0.005) to sequences in GenBank. Among the 748 sequences with significant GenBank matches, 160 (21.4%) were for genes related to metabolism, 131 (17.5%) for cell/organism defense, 124 (16.6%) for gene/protein expression, 83 (11.1%) for cell structure/motility, 70 (9.4%) for cell signaling/communication, 17 (2.3%) for cell division, and 163 (21.8%) matched to genes of unknown functions. The list of host-defense genes included many genes with known and important roles in innate defense such as lectins, defensins, proteases, protease inhibitors, heat shock proteins, antioxidants, and Toll-like receptors. The study provides a significant number of ESTs for gene discovery and candidate genes for studying host defense in scallops and other molluscs.

Entendendo e interpretando os parâmetros utilizados por BLAST.

O método BLAST para determinação de similaridades entre sequências biológicas. Score e matrizes de substituição. Determinação de matrizes de substituição BLOSUM. Determinação de matrizes de substituição PAM. Resultados da teoria Estatística de comparação local de sequências. O Algoritmo usado por BLAST. NCBI-BLAST. Exemplo de busca.