Filters








28,773 Hits in 2.9 sec

Circular Pattern Matching with k Mismatches [chapter]

Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
2019 Lecture Notes in Computer Science  
This is the circular pattern matching with k mismatches (k-CPM) problem.  ...  The k-mismatch problem consists in computing the Hamming distance between a pattern P of length m and every length-m substring of a text T of length n, if this distance is no more than k.  ...  This is the circular pattern matching with k mismatches (k-CPM) problem.  ... 
doi:10.1007/978-3-030-25027-0_15 fatcat:z6sytp7b7nc3xkykuvus6xhz3m

Circular pattern matching with k mismatches

Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
2020 Journal of computer and system sciences (Print)  
This is the circular pattern matching with k mismatches (k-CPM) problem.  ...  a r t i c l e i n f o a b s t r a c t We consider the circular pattern matching with k mismatches (k-CPM) problem in which one is to compute the minimal Hamming distance of every length-m substring of  ...  Circular Pattern Matching with k Mismatches can be solved in O(min(nk, n + n m k 4 )) time and O(m) space. table.  ... 
doi:10.1016/j.jcss.2020.07.003 fatcat:jepd5jdl6jaghjib6jjy7pgx7q

Circular Pattern Matching with k Mismatches [article]

Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
2020 arXiv   pre-print
This is the circular pattern matching with k mismatches (k-CPM) problem.  ...  The k-mismatch problem consists in computing the Hamming distance between a pattern P of length m and every length-m substring of a text T of length n, if this distance is no more than k.  ...  This is the circular pattern matching with k mismatches (k-CPM) problem.  ... 
arXiv:1907.01815v2 fatcat:s2akgj2q6vcktlktoxjunfjosi

New layout strategies with improved matching performance

Chengming He, Xin Dai, Hanqing Xing, Degang Chen
2006 Analog Integrated Circuits and Signal Processing  
Among these three techniques, the central symmetry patterns have the best-reported matching performance for Manhattan structures; the circular-symmetry patterns have the best theoretical matching performance  ...  Three layout strategies with improved matching performance are reviewed and summarized.  ...  N th order circular symmetry pattern The circular symmetry layout pattern is initially proposed for 1-1 matching between two devices.  ... 
doi:10.1007/s10470-006-9705-1 fatcat:hwcn3j25zng7zjpw2ssvsiclva

Approximate Online Matching of Circular Strings [chapter]

Tommi Hirvola, Jorma Tarhio
2014 Lecture Notes in Computer Science  
From this algorithm, we derive several sublinear methods for approximate online matching of circular strings. The applicability of the new algorithms is demonstrated with practical experiments.  ...  Recently a fast algorithm based on the BNDM algorithm has been presented for exact matching of circular strings.  ...  matching of circular strings with k errors.  ... 
doi:10.1007/978-3-319-07959-2_27 fatcat:ubtjowdobbfqxe26qe7czxnkke

Fast algorithms for approximate circular string matching

Carl Barton, Costas S Iliopoulos, Solon P Pissis
2014 Algorithms for Molecular Biology  
Conclusions: We present two fast average-case algorithms for approximate circular string matching with k-mismatches; and show that they also perform very well in practice.  ...  Based on our solution for the exact case, we present two fast average-case algorithms for approximate circular string matching with k-mismatches, under the Hamming distance model, requiring time O(n) for  ...  string matching with k-mismatches.  ... 
doi:10.1186/1748-7188-9-9 pmid:24656145 pmcid:PMC4234210 fatcat:6npbh4o5hrcwzjeqe6iblpek2y

sRNA Profiler: A User-Focused Interface for Small RNA Mapping and Profiling

Charith Raj Adkar-Purushothama, Pavithran Sridharan Iyer, Teruo Sano, Jean-Pierre Perreault
2021 Cells  
In order to overcome this constraint, and to help the research community in general, in this study, a python-based pattern matching interface was developed so as to be able to both profile and map sRNAs  ...  on a circular genome.  ...  To summarize, two length k strings α and β match approximately with at most δ mismatches if and only if the Hamming weight of b(α)·b(β) is at most k − δ.  ... 
doi:10.3390/cells10071771 pmid:34359940 pmcid:PMC8303536 fatcat:ybvlwj35gzeo5je2sa2vz3rk74

Subject Index

2007 Journal of Discrete Algorithms  
with mismatches Parameterized matching with mismatches, 135 Pattern-matching A simple fast hybrid pattern-matching algorithm, 682 Periodicity Two-pattern strings II-frequency of occurrence and substring  ...  particle filters, 455 Path coupling Path coupling without contraction, 280 PATRICIA tree Text indexing with errors, 662 Pattern matching Parameterized matching with mismatches, 135; Searching for  ... 
doi:10.1016/s1570-8667(07)00076-7 fatcat:wfqxglrznfb6do3wyittd5pfbi

Generalised Implementation for Fixed-Length Approximate String Matching under Hamming Distance and Applications

Solon Pissis, Ahmad Retha
2015 2015 IEEE International Parallel and Distributed Processing Symposium Workshop  
Approximate string matching is the problem of finding all factors of a text t of length n with a distance at most k from a pattern x of length m ≤ n.  ...  Fixed-length approximate string matching is the problem of finding all factors of a text t of length n with a distance at most k from any factor of length h of a pattern x of length m ≤ n, where h ≤ m.  ...  That is, D[m, j] ≤ k denotes an occurrence of x at the ending position j − 1 in t with at most k mismatches.  ... 
doi:10.1109/ipdpsw.2015.106 dblp:conf/ipps/PissisR15 fatcat:ttxri4mxtbbdzm5gni6d6p2kra

Fast String Matching with Mismatches

R.A. Baezayates, G.H. Gonnet
1994 Information and Computation  
We describe and analyze three simple and fast algorithms on the average for solving the problem of string matching with a bounded number of mismatches.  ...  Introduction The problem of string matching with k mismatches consists of nding all occurrences of a pattern of length m in a text of length n such that in at most k positions the text and the pattern  ...  , with at most k mismatches.  ... 
doi:10.1006/inco.1994.1007 fatcat:3iy3uwtmbfhsheumfmreiexbpy

Effect of surface texture and geometry on spoof surface plasmon dispersion

Shun-Hui Yang
2008 Optical Engineering: The Journal of SPIE  
We then compare the specific cases of circular versus rectangular textured surfaces and observe that the plasmon modes are less tightly bound in the former case.  ...  For example, we find that SPPs are less tightly bound to a surface patterned with circular holes compared to a surface comprising square/rectangular holes due to a smaller momentum mismatch.  ...  The size of the circular holes ͑R=88 nm, D=350 nm͒ is chosen to match the plasmon frequency of the rectangular patterned surface ͑a=b=150 nm, D =350 nm͒.  ... 
doi:10.1117/1.2844723 fatcat:m4iyd65d4nfldjoc5y5yqu5scu

Camera focusing based on fringe pattern matching

Peter J. Bryanston-Cross, Zuobin Wang
1997 Applied Optics  
A method of camera focusing based on fringe pattern matching is presented. In the method, the variance of the mismatch function is used as a focus measure.  ...  The experimental results show that the focus measure based on fringe pattern matching performs well in peak sharpness, monotonicity, and noise sensitivity and that it has a better performance in noise  ...  In fringe pattern matching, the mismatch function for the fringe patterns with vertical fringes can be calculated by 8, 9 f k ͑t͒ ϭ 1 MN ͚ mϭ1 M ͚ nϭ1 N ͓I k ͑m, n͒ Ϫ I k ͑m, n ϩ t͔͒ 2 , k ϭ 0, 1, 2,  ... 
doi:10.1364/ao.36.006498 pmid:18259510 fatcat:n4qr6tmvr5by7kw4k35jyzklne

gkmSVM: an R package for gapped-kmer SVM

Mahmoud Ghandi, Morteza Mohammad-Noori, Narges Ghareghani, Dongwon Lee, Levi Garraway, Michael A. Beer
2016 Bioinformatics  
This package supports several sequence kernels, including: gkmSVM, kmer-SVM, mismatch kernel and wildcard kernel.  ...  We then build a k-mer tree using all the mismatch patterns assigned to each pass and use that to prune the DFS search in that pass.  ...  In practice, we generate all the possible patterns of mismatches (all the binary strings of length L with at most D ones) and assign each mismatch pattern d to the pass p that gives the minimum cost: p  ... 
doi:10.1093/bioinformatics/btw203 pmid:27153639 pmcid:PMC4937197 fatcat:tt2v7hllwvfefn346fk4x5bf3y

Identification of Fingerprints using Circular String Approximation for Mobile Devices

Oluwole I. Ajala, Costas S. Iliopoulos, Mujibur R. Khan
2017 Communiation Papers of the 2017 Federated Conference on Computer Science and Information Systems  
stage and then match the fingerprint image with stored images using algorithms for approximate circular string matching.  ...  Responding to this issue, this report proposes a novel pattern matching technique that caters for orientation differences in fingerprints, by implementing a pre-matching stage called the orientation identification  ...  It takes into consideration that there could be errors or mismatches from unnecessary characters in both texts and patterns, insertions and deletions (k differences).  ... 
doi:10.15439/2017f3 dblp:conf/fedcsis/AjalaIK17 fatcat:cbnhmwsqjfedxp7p2joavgqh5i

New Error Tolerant Method to Search Long Repeats in Symbol Sequences [article]

Sergey Tsarev, Michael Sadovsky
2016 arXiv   pre-print
It allows the matching of substrings to contain a given level of errors.  ...  Sadovsky) and the grant from Russian Ministry of Education and Science to Siberian Federal University, contract N o 1.1462.2014/K (S. P. Tsarev). The authors thank Prof. S. V.  ...  For any given integer N find circular and linear Vernier patterns with minimal possible k. Such Vernier patterns are called minimal Vernier patterns.  ... 
arXiv:1604.01317v1 fatcat:pzll4xkc3rgwxfhg7pbacsadce
« Previous Showing results 1 — 15 out of 28,773 results