標題: Titlebook: Combinatorial Pattern Matching; 25th Annual Symposiu Alexander S. Kulikov,Sergei O. Kuznetsov,Pavel Pev Conference proceedings 2014 Springe [打印本頁] 作者: Jaundice 時間: 2025-3-21 18:07
書目名稱Combinatorial Pattern Matching影響因子(影響力)
書目名稱Combinatorial Pattern Matching影響因子(影響力)學科排名
書目名稱Combinatorial Pattern Matching網(wǎng)絡公開度
書目名稱Combinatorial Pattern Matching網(wǎng)絡公開度學科排名
書目名稱Combinatorial Pattern Matching被引頻次
書目名稱Combinatorial Pattern Matching被引頻次學科排名
書目名稱Combinatorial Pattern Matching年度引用
書目名稱Combinatorial Pattern Matching年度引用學科排名
書目名稱Combinatorial Pattern Matching讀者反饋
書目名稱Combinatorial Pattern Matching讀者反饋學科排名
作者: nonplus 時間: 2025-3-21 22:29
‘Safety and Cybersecurity in a?Digital Age’a generalization is necessary for clustering. One needs to consider a partition into a number of sets, each with a distinct centerstring. In this paper we define two natural versions of the consensus problem for c centerstrings. We analyse the hardness and fixed parameter tractability of these problems and provide approximation algorithms.作者: Immunoglobulin 時間: 2025-3-22 03:52 作者: overweight 時間: 2025-3-22 06:18 作者: 出沒 時間: 2025-3-22 10:42 作者: Watemelon 時間: 2025-3-22 13:53 作者: Watemelon 時間: 2025-3-22 20:12
https://doi.org/10.1007/978-3-319-74549-7utomaton and is often brought as an example of a problem whose decision by a single-tape Turing machine requires quadratic time..In this paper we re-visit the palindrome recognition problem. We define a novel fingerprint that allows recognizing palindromes on-line in linear time with high probabilit作者: 有雜色 時間: 2025-3-22 22:45
‘Safety and Cybersecurity in a?Digital Age’, Kolesnichenko and Starikovskaya?[CPM’13]. For the minimal suffix problem we show that for any 1?≤?.?≤?log. there exists a linear-space data structure with . query time and . preprocessing time. As a sample application, we show that this data structure can be used to compute the Lyndon decompositio作者: Exposition 時間: 2025-3-23 04:27 作者: Deject 時間: 2025-3-23 09:26 作者: Minatory 時間: 2025-3-23 12:26
Ourania Rizou,Aikaterini Klonaritant in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal words is a bubble language, a class of binary languages 作者: Constant 時間: 2025-3-23 14:34
Ourania Rizou,Aikaterini Klonarice of a pattern which is enlarged proportionally by some scale . within a larger text. Permutation matching is the problem of finding all substrings within a text where the character statistics of the substring and the pattern are the same. Permutation matching is easy, while scaled matching require作者: Freeze 時間: 2025-3-23 18:46 作者: 減去 時間: 2025-3-24 00:35 作者: Prosaic 時間: 2025-3-24 04:09 作者: 反復拉緊 時間: 2025-3-24 09:35 作者: 無意 時間: 2025-3-24 14:02 作者: ascend 時間: 2025-3-24 18:35
https://doi.org/10.1007/978-3-662-62153-0mitted to Theor. Comp. Sci.), where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we additionally allow up to . mismatches between the pattern of length . and the text of length ., and the goal is to con作者: 有機體 時間: 2025-3-24 20:41 作者: MILK 時間: 2025-3-25 00:52
https://doi.org/10.1007/978-981-16-2019-5ce algorithm to compute smallest palindromic factorizations of all prefixes of ., where . is the length of a given string .. We then show how to extend this algorithm to compute smallest maximal palindromic factorizations of all prefixes of ., consisting only of maximal palindromes (non-extensible p作者: 中世紀 時間: 2025-3-25 03:54
Sujata S. Govada,Hei Lau,Suhasini Kotala a one-to-one mapping .:..?→?.., such that for every .?∈?.., it holds that .′.???..?≤?., where ., ., and . denotes the set of vertices which have distance at most?. to . in a graph .. We call this problem . (CPM). In the paper we study CPM with input graphs being trees and present a dichotomy of cla作者: 最小 時間: 2025-3-25 07:50 作者: 明智的人 時間: 2025-3-25 13:21 作者: Congeal 時間: 2025-3-25 17:06 作者: 初學者 時間: 2025-3-25 21:21
On the Efficiency of the Hamming C-Centerstring Problems,a generalization is necessary for clustering. One needs to consider a partition into a number of sets, each with a distinct centerstring. In this paper we define two natural versions of the consensus problem for c centerstrings. We analyse the hardness and fixed parameter tractability of these problems and provide approximation algorithms.作者: 懲罰 時間: 2025-3-26 03:06
Conference proceedings 2014ne 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays. The goal作者: 相反放置 時間: 2025-3-26 06:45 作者: 安撫 時間: 2025-3-26 09:31
,Compressed Subsequence Matching and Packed?Tree?Coloring, that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.作者: 洞察力 時間: 2025-3-26 14:37
Reversal Distances for Strings with Few Blocks or Small Alphabets,of blocks they contain (a block being maximal substring such that all letters in the substring are equal), and the alphabet size?Σ. For instance, we show that . and . are NP-hard even if the input strings have only . letter.作者: 洞穴 時間: 2025-3-26 20:39
On Combinatorial Generation of Prefix Normal Words,with the property that, for any word . in the language, exchanging the first occurrence of 01 by 10 in . results in another word in the language. We prove that each prefix normal word is produced in .(.) amortized time, and conjecture, based on experimental evidence, that the true amortized running time is .(log(.)).作者: 是比賽 時間: 2025-3-26 21:33 作者: ANN 時間: 2025-3-27 03:09 作者: custody 時間: 2025-3-27 06:17
An Improved Query Time for Succinct Dynamic Dictionary Matching,me is .((loglog.) log.), where . is the size of the alphabet..A byproduct of this paper is an Aho-Corasick automaton that can be constructed with only a compact working space, which is the first of its type to the best of our knowledge.作者: Defense 時間: 2025-3-27 13:10 作者: tympanometry 時間: 2025-3-27 17:12
Advances in 21st Century Human Settlementsstring, while their algorithm uses the suffix tree of the string and other auxiliary data structures. Our theoretical results are validated by an empirical study that shows our method is much faster and more space-saving.作者: 朋黨派系 時間: 2025-3-27 21:27 作者: DEMN 時間: 2025-3-28 01:53
Shortest Unique Substring Query Revisited,string, while their algorithm uses the suffix tree of the string and other auxiliary data structures. Our theoretical results are validated by an empirical study that shows our method is much faster and more space-saving.作者: 前兆 時間: 2025-3-28 03:42
Conference proceedings 2014ng computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.作者: 航海太平洋 時間: 2025-3-28 06:36 作者: Visual-Field 時間: 2025-3-28 13:15
https://doi.org/10.1007/978-3-319-74549-7olving other problems on-line. In particular we consider approximate pattern matching by non-overlapping reversals. This is the problem where two strings . and . are given and the question is whether applying a sequence of non-overlapping reversals to . results in string ..作者: 使成波狀 時間: 2025-3-28 14:57 作者: conception 時間: 2025-3-28 21:49
Approximate On-line Palindrome Recognition, and Applications,olving other problems on-line. In particular we consider approximate pattern matching by non-overlapping reversals. This is the problem where two strings . and . are given and the question is whether applying a sequence of non-overlapping reversals to . results in string ..作者: 空中 時間: 2025-3-29 00:22
From Indexing Data Structures to de Bruijn Graphs,and dBGs, and exhibit linear time algorithms for constructing the full or contracted dBGs. Finally, we provide hints explaining why this bridge between indexes and dBGs enables to dynamically update the order . of the graph.作者: 破布 時間: 2025-3-29 04:10
0302-9743 sia, in June 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays作者: Tonometry 時間: 2025-3-29 10:18
https://doi.org/10.1007/978-3-662-62153-0ere are . distinct colors. We then restrict our attention to the case in which there are only two distinct colors. We give an index that uses . bits and . query time to detect whether there exists a matching rectangle. Finally, we give a .-space index that returns a matching rectangle, if one exists, in . time.作者: Jocose 時間: 2025-3-29 13:21 作者: 危機 時間: 2025-3-29 16:19
https://doi.org/10.1007/978-981-16-2019-5d this algorithm to compute smallest maximal palindromic factorizations of all prefixes of ., consisting only of maximal palindromes (non-extensible palindromic substring) of each prefix, in .(. log.) time and .(.) space, in an on-line manner. We also present an on-line .(.)-time .(.)-space algorithm to compute a smallest palindromic cover of ..作者: 是突襲 時間: 2025-3-29 22:41
Sujata S. Govada,Hei Lau,Suhasini Kotalaance at most?. to . in a graph .. We call this problem . (CPM). In the paper we study CPM with input graphs being trees and present a dichotomy of classical complexity with respect to different values of . and .. CPM on trees can be solved in polynomial time only if .?≤?2 and?.?≤?1.作者: Commonwealth 時間: 2025-3-30 01:15 作者: 我悲傷 時間: 2025-3-30 07:33 作者: Chivalrous 時間: 2025-3-30 09:44 作者: 支架 時間: 2025-3-30 15:47
Compactness-Preserving Mapping on Trees,ance at most?. to . in a graph .. We call this problem . (CPM). In the paper we study CPM with input graphs being trees and present a dichotomy of classical complexity with respect to different values of . and .. CPM on trees can be solved in polynomial time only if .?≤?2 and?.?≤?1.作者: 痛得哭了 時間: 2025-3-30 18:04
‘Safety and Cybersecurity in a?Digital Age’n of any substring of the text in . time, where . is the number of distinct factors in the decomposition. For the maximal suffix problem we give a linear-space structure with . query time and . preprocessing time, i.e., we manage to achieve both the optimal query and the optimal construction time simultaneously.作者: Admonish 時間: 2025-3-31 00:22
https://doi.org/10.1007/978-3-030-28191-5 that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.作者: constitute 時間: 2025-3-31 02:19
Velislava Simeonova,Kalina Milkovaof blocks they contain (a block being maximal substring such that all letters in the substring are equal), and the alphabet size?Σ. For instance, we show that . and . are NP-hard even if the input strings have only . letter.作者: 有組織 時間: 2025-3-31 07:44 作者: Indelible 時間: 2025-3-31 12:39 作者: 通便 時間: 2025-3-31 14:06
https://doi.org/10.1007/978-3-662-62153-0lications in bioinformatics. In this paper we develop the first randomized parameterized algorithms for CSP. Not only are the randomized algorithms much simpler than their deterministic counterparts, their expected-time complexities are also significantly better than the previously best known (deterministic) algorithms.作者: 演講 時間: 2025-3-31 19:00
https://doi.org/10.1007/978-3-662-62153-0me is .((loglog.) log.), where . is the size of the alphabet..A byproduct of this paper is an Aho-Corasick automaton that can be constructed with only a compact working space, which is the first of its type to the best of our knowledge.作者: Pessary 時間: 2025-4-1 00:48
On the Efficiency of the Hamming C-Centerstring Problems,a generalization is necessary for clustering. One needs to consider a partition into a number of sets, each with a distinct centerstring. In this paper we define two natural versions of the consensus problem for c centerstrings. We analyse the hardness and fixed parameter tractability of these probl作者: Kidney-Failure 時間: 2025-4-1 02:57
Dictionary Matching with One Gap,s a sequence of subpatterns separated by bounded sequences of don’t cares. Then, given a query text . of length . over alphabet Σ, the goal is to output all locations in . in which a pattern ..?∈?., 1?≤?.?≤?., ends. There is a renewed current interest in the gapped matching problem stemming from cyb作者: 吃掉 時間: 2025-4-1 07:39 作者: cleaver 時間: 2025-4-1 10:15
Computing Minimal and Maximal Suffixes of a Substring Revisited,, Kolesnichenko and Starikovskaya?[CPM’13]. For the minimal suffix problem we show that for any 1?≤?.?≤?log. there exists a linear-space data structure with . query time and . preprocessing time. As a sample application, we show that this data structure can be used to compute the Lyndon decompositio作者: Encoding 時間: 2025-4-1 14:41 作者: Comprise 時間: 2025-4-1 21:12
