Filters








1,033 Hits in 7.3 sec

Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant

Brian Brubach, Marc Herbstritt
2018 Annual Symposium on Combinatorial Pattern Matching  
We present a new approach to approximating the Maximum Duo-Preservation String Mapping Problem (MPSM) based on massaging the constraints into a tractable matching problem.  ...  Recently, Mehrabi [28] introduced the more general weighted variant, Maximum Weight Duo-Preservation String Mapping (MWPSM) and provided a 6-approximation.  ...  Acknowledgements The author wishes to thank advisors Mihai Pop and Aravind Srinivasan for their support, guidance, and encouragement.  ... 
doi:10.4230/lipics.cpm.2018.5 dblp:conf/cpm/Brubach18 fatcat:krm5t2xwmje5npcy3rbvoeq4gm

A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem [article]

Bartłomiej Dudek, Paweł Gawrychowski, Piotr Ostropolski-Nalewaja
2017 arXiv   pre-print
In the Maximum Duo-Preservation String Mapping problem we are given two strings and wish to map the letters of the former to the letters of the latter so as to maximise the number of duos.  ...  Maximum Duo-Preservation String Mapping is APX-hard. After a series of improvements, Brubach [WABI 2016] showed a polynomial-time 3.25-approximation algorithm.  ...  There was also some interest in the complementary problem called the Maximum Duo-Preservation String Mapping (MPSM), introduced by Chen et al. [7] .  ... 
arXiv:1702.02405v2 fatcat:56kof6g7rndkbhruhykwlalqb4

A $$(1.4 + \epsilon )$$-approximation algorithm for the 2-Max-Duo problem

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
2020 Journal of combinatorial optimization  
The maximum duo-preservation string mapping (Max-Duo) problem is the complement of the well studied minimum common string partition (MCSP) problem, both of which have applications in many fields including  ...  In particular, 2-Max-Duo can then be approximated arbitrarily close to 1.8 using the state-of-the-art approximation algorithm for the MIS problem. 2-Max-Duo was proved APX-hard and very recently a (1.6  ...  With the complementary objective to that of MCSP, the problem of maximizing the number of duos preserved in the common partition is referred to as the maximum duo-preservation string mapping problem by  ... 
doi:10.1007/s10878-020-00621-0 fatcat:hhl5ska7vne35kbkqen2bad42u

A (1.4 + ϵ)-approximation algorithm for the 2-Max-Duo problem [article]

Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang
2017 arXiv   pre-print
The maximum duo-preservation string mapping (Max-Duo) problem is the complement of the well studied minimum common string partition (MCSP) problem, both of which have applications in many fields including  ...  In particular, 2-Max-Duo can then be approximated arbitrarily close to 1.8 using the state-of-the-art approximation algorithm for the MIS problem. 2-Max-Duo was proved APX-hard and very recently a (1.6  ...  With the complementary objective to that of MCSP, the problem of maximizing the number of duos preserved in the common partition is referred to as the maximum duo-preservation string mapping problem by  ... 
arXiv:1702.06256v2 fatcat:qj5xgh6t6vbplcj4brbfjsicuy

A local search 2.917-approximation algorithm for duo-preservation string mapping [article]

Yao Xu, Yong Chen, Taibo Luo, Guohui Lin
2017 arXiv   pre-print
We study the maximum duo-preservation string mapping ( Max-Duo) problem, which is the complement of the well studied minimum common string partition ( MCSP) problem.  ...  Both problems have applications in many fields including text compression and bioinformatics.  ...  The complementary objective to that of MCSP is to maximize the number of duos preserved in the common partition, which is referred to as the maximum duo-preservation string mapping (Max-Duo) problem by  ... 
arXiv:1702.01877v1 fatcat:oov6ohrczvg77gafebdr6kiugm

Privacy-preserving speaker verification as password matching

Manas A. Pathak, Bhiksha Raj
2012 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
they map to the same string.  ...  This transformation, therefore, reduces the problem of identifying nearest neighbors to string comparison.  ...  A set of data points that map to the same key are considered as approximate nearest neighbors.  ... 
doi:10.1109/icassp.2012.6288262 dblp:conf/icassp/PathakR12 fatcat:d3mersvjgvckfpbwvos2ic2dfa

A Gram-Based String Paradigm for Efficient Video Subsequence Search

Zi Huang, Jiajun Liu, Bin Cui, Xiaoyong Du
2013 IEEE transactions on multimedia  
In VideoGram, the feature space is modeled as a set of visual words. Each database video sequence is mapped into a string.  ...  Inspired by the high efficiency of string indexing methods, in this paper, we present a string paradigm called VideoGram for large-scale video sequence indexing to achieve fast similarity search.  ...  On the other hand, in the query expansion process, a Likelihood-Visual-Word (LVW) for a high-dimensional query frame also carries the spatial similarity which can be preserved when mapping into the visual  ... 
doi:10.1109/tmm.2012.2236307 fatcat:tcopeotgkjd3rayabxpqoaxgw4

Computing Genomic Distances: An Algorithmic Viewpoint [chapter]

Guillaume Fertin, Irena Rusu
2010 Algorithms in Computational Molecular Biology  
Recall that a duo in a string S is just a substring of length 2 of S, and let us denote by duos(S) the set of duos of S.  ...  Let P and Q be two balanced strings containing signed integers, let n = m P = m Q , and let k be the maximum number of copies of a gene in P (resp. in Q).  ... 
doi:10.1002/9780470892107.ch34 fatcat:4aqmnbegx5dlzkpwlfvvok425u

Parameterized Algorithms in Bioinformatics: An Overview

Laurent Bulteau, Mathias Weller
2019 Algorithms  
Aside from reporting the state of the art, we give challenges and open problems for each topic.  ...  This work surveys recent developments of parameterized algorithms and complexity for important NP-hard problems in bioinformatics.  ...  Acknowledgments: The authors want to thank Fran Rosamond for suggesting the topic as well as everyone who helped collect interesting results for the manuscript, in particular Jesper Jansson, Steven Kelk  ... 
doi:10.3390/a12120256 fatcat:4dhjdnpibzh43iifgan2fu6bwa

A Parallel Genetic Algorithm for Pattern Recognition in Mixed Databases [chapter]

Angel Kuri-Morales, Javier Sagastuy-Breña
2017 Lecture Notes in Computer Science  
To do this we must consider the fact that there is a limited subset of codes which will preserve the patterns in the MD.  ...  Metric clustering algorithms are ineffectual when presented with MDs because, in such algorithms, the similarity between the objects is determined by measuring the differences between them, in accordance  ...  The results are shown in Fig. 4 . After 200 epochs, there appears to be no further improvement in terms of final fitness.  ... 
doi:10.1007/978-3-319-59226-8_2 fatcat:ln5rzwmvifgmvmum7ctp6x2clq

Faster secure two-party computation with less memory

Wilko Henecka, Thomas Schneider
2013 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13  
In this paper we present an improved implementation of Yao's garbled circuit protocol in the semi-honest adversaries setting which is up to 10 times faster than previous implementations.  ...  Our improvements include (1) the first multithreaded implementation of the base oblivious transfers resulting in a speedup of a factor of two, (2) techniques for minimizing the memory footprint during  ...  The second author was supported by the German Federal Ministry of Education and Research (BMBF) within EC SPRIDE and by the Hessian LOEWE excellence initiative within CASED.  ... 
doi:10.1145/2484313.2484369 dblp:conf/ccs/Henecka013 fatcat:gu7ovx6co5d3ddmgcaov34cmzq

Privacy-preserving speech processing: cryptographic and string-matching frameworks show promise

M. A. Pathak, B. Raj, S. D. Rane, P. Smaragdis
2013 IEEE Signal Processing Magazine  
Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that  ...  This work may not be copied or reproduced in whole or in part for any commercial purpose.  ...  A set of data points that map to the same key are considered as approximate nearest neighbors (Figure 1) .  ... 
doi:10.1109/msp.2012.2230222 fatcat:k2djygz765bpflblw3wgh2k75e

Solving string constraints lazily

Pieter Hooimeijer, Westley Weimer
2010 Proceedings of the IEEE/ACM international conference on Automated software engineering - ASE '10  
Separating string analysis from its client applications has important and familiar benefits: it enables the independent improvement of string analysis tools and it saves client effort.  ...  Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks.  ...  We use this information only if no other Path restrictions are present; this is necessary to ensure that we generate strings up to the correct maximum length (if we didn't involve all automata in the intersection  ... 
doi:10.1145/1858996.1859080 dblp:conf/kbse/HooimeijerW10 fatcat:3a53gpnl4bee5guzg46c63gsdi

Bayesian Induction of Bracketing Inversion Transduction Grammars

Markus Saers, Dekai Wu
2013 International Joint Conference on Natural Language Processing  
We present a novel approach to learning phrasal inversion transduction grammars via Bayesian MAP (maximum a posteriori) or information-theoretic MDL (minimum description length) model optimization so as  ...  Since the priors reward model parsimony, the learned grammar is very concise and still performs significantly better than the maximum likelihood driven bottom-up rule chunking baseline.  ...  Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA, the EU, or RGC.  ... 
dblp:conf/ijcnlp/SaersW13 fatcat:eru5nur6xnfbxhsfrqd2fyxs5i

Literature Survey on Stereo Vision Disparity Map Algorithms

Rostam Affendi Hamzah, Haidi Ibrahim
2016 Journal of Sensors  
This literature survey also presents a method of qualitative measurement that is widely used by researchers in the area of stereo vision disparity mappings.  ...  This paper presents a literature survey on existing disparity map algorithms.  ...  Acknowledgments This work was supported in part by the Universiti Sains Malaysia Research University Individual (RUI) with Account no. 1001/PELECT/814169 and the Universiti Teknikal Malaysia Melaka.  ... 
doi:10.1155/2016/8742920 fatcat:o23jgt6w2bgnvegulnun5f6myi
« Previous Showing results 1 — 15 out of 1,033 results