Feature Hashing with Insertion and Deletion of Features

Author(s):  
Rameshwar Pratap ◽  
Suryakant Bhardwaj ◽  
Hrushikesh Sudam Sarode ◽  
Raghav Kulkarni
2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Yu Zhang ◽  
Yin Li ◽  
Yifan Wang

Searchable symmetric encryption that supports dynamic multikeyword ranked search (SSE-DMKRS) has been intensively studied during recent years. Such a scheme allows data users to dynamically update documents and retrieve the most wanted documents efficiently. Previous schemes suffer from high computational costs since the time and space complexities of these schemes are linear with the size of the dictionary generated from the dataset. In this paper, by utilizing a shallow neural network model called “Word2vec” together with a balanced binary tree structure, we propose a highly efficient SSE-DMKRS scheme. The “Word2vec” tool can effectively convert the documents and queries into a group of vectors whose dimensions are much smaller than the size of the dictionary. As a result, we can significantly reduce the related space and time cost. Moreover, with the use of the tree-based index, our scheme can achieve a sublinear search time and support dynamic operations like insertion and deletion. Both theoretical and experimental analyses demonstrate that the efficiency of our scheme surpasses any other schemes of the same kind, so that it has a wide application prospect in the real world.


2012 ◽  
Vol 100 ◽  
pp. 48-62
Author(s):  
E.P. de Vink ◽  
H. Zantema ◽  
D. Bošnački

2021 ◽  
Vol 70 ◽  
pp. 1335-1371
Author(s):  
Giuseppe De Giacomo ◽  
Xavier Oriol ◽  
Riccardo Rosati ◽  
Domenico Fabio Savo

In this paper we study instance-level update in DL-LiteA , a well-known description logic that influenced the OWL 2 QL standard. Instance-level update regards insertions and deletions in the ABox of an ontology. In particular we focus on formula-based approaches to instance-level update. We show that DL-LiteA , which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for instance-level update. That is, every update can be reformulated into a set of insertion and deletion instructions computable through a non-recursive Datalog program with negation. Such a program is readily translatable into a first-order query over the ABox considered as a database, and hence into SQL. By exploiting this result, we implement an update component for DL-LiteA-based systems and perform some experiments showing that the approach works in practice.


2018 ◽  
Author(s):  
Maxime Garcia ◽  
Szilveszter Juhos ◽  
Malin Larsson ◽  
Pall I. Olason ◽  
Marcel Martin ◽  
...  

AbstractSummaryWhole-genome sequencing (WGS) is a cornerstone of precision medicine, but portable and reproducible open-source workflows for WGS analyses of germline and somatic variants are lacking. We present Sarek, a modular, comprehensive, and easy-to-install workflow, combining a range of software for the identification and annotation of single-nucleotide variants (SNVs), insertion and deletion variants (indels), structural variants, tumor sample heterogeneity, and karyotyping from germline or paired tumor/normal samples. Sarek is implemented in a bioinformatics workflow language (Nextflow) with Docker and Singularity compatible containers, ensuring easy deployment and full reproducibility at any Linux based compute cluster or cloud computing environment. Sarek supports the human reference genomes GRCh37 and GRCh38, and can readily be used both as a core production workflow at sequencing facilities and as a powerful stand-alone tool for individual research groups.AvailabilitySource code and instructions for local installation are available at GitHub (https://github.com/SciLifeLab/Sarek) under the MIT open-source license, and we invite the research community to contribute additional functionality as a collaborative open-source development project.


Genetics ◽  
1988 ◽  
Vol 118 (1) ◽  
pp. 13-19
Author(s):  
R K Pearson ◽  
M S Fox

Abstract Previous studies of bacteriophage lambda recombination have provided indirect evidence that substantial sequence nonhomologies, such as insertions and deletions, may be included in regions of heteroduplex DNA. However, the direct products of heterology-containing heteroduplex DNA--heterozygous progeny phage--have not been observed. We have constructed a series of small insertion and deletion mutations in the cI gene to examine the possibility that small heterologies might be accommodated in heterozygous progeny phage. Genetic crosses were carried out between lambda cI- Oam29 and lambda cI+ Pam80 under replication-restricted conditions. Recombinant O+P+ progeny were selected on mutL hosts and tested for cI heterozygosity. Heterozygous recombinants were readily observed with crosses involving insertions of 4 to 19 base pairs (bp) in the cI gene. Thus, nonhomologies of at least 19 bp can be accommodated in regions of heteroduplex DNA during lambda recombination. In contrast, when a cI insertion or deletion mutation of 26 bp was present, few of the selected recombinants were heterozygous for cI. Results using a substitution mutation, involving a 26-bp deletion with a 22-bp insertion, suggest that the low recovery of cI heterozygotes containing heterologies of 26 bp or more is due to a failure to encapsulate DNA containing heterologies of 26 bp or more into viable phage particles.


Sign in / Sign up

Export Citation Format

Share Document