標(biāo)題: Titlebook: String Processing and Information Retrieval; 28th International S Thierry Lecroq,Hélène Touzet Conference proceedings 2021 Springer Nature [打印本頁] 作者: coerce 時(shí)間: 2025-3-21 19:53
書目名稱String Processing and Information Retrieval影響因子(影響力)
書目名稱String Processing and Information Retrieval影響因子(影響力)學(xué)科排名
書目名稱String Processing and Information Retrieval網(wǎng)絡(luò)公開度
書目名稱String Processing and Information Retrieval網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱String Processing and Information Retrieval被引頻次
書目名稱String Processing and Information Retrieval被引頻次學(xué)科排名
書目名稱String Processing and Information Retrieval年度引用
書目名稱String Processing and Information Retrieval年度引用學(xué)科排名
書目名稱String Processing and Information Retrieval讀者反饋
書目名稱String Processing and Information Retrieval讀者反饋學(xué)科排名
作者: Conscientious 時(shí)間: 2025-3-21 20:42
Longest Common Rollercoasterstively the lengths of . and .. The second runs in . time and .(.) space, where . is the number of pairs (.,?.) of matching points such that ., assuming that . and that .,?. only consist of characters which occur in both strings. The second algorithm is faster than the first one when . is sub-linear in ..作者: 離開 時(shí)間: 2025-3-22 01:53
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalen have different approximation factors. In this paper, we show that it is not the case: all factors are equal. To prove this, we show how to transform a set of strings so that all overlaps are different whereas their ratios stay roughly the same.作者: Ganglion 時(shí)間: 2025-3-22 08:21
On the Approximation Ratio of LZ-End to LZ77 phrases asymptotically approaches 2. However, the alphabet size of these strings is unbounded. In this paper, we analyze the LZ-End factorization of the period-doubling sequence. We also show that the approximation ratio for the period-doubling sequence asymptotically approaches 2 for the binary alphabet.作者: 胰臟 時(shí)間: 2025-3-22 09:40
r-Indexing the eBWTIn our prior work [SPIRE 2021], we give a linear-time algorithm for the . that preserves the fundamental property of the original definition (i.e., the independence from the input order). The algorithm combines a modification of the Suffix Array Induced Sorting (SAIS) algorithm [IEEE Trans Comput 20作者: Root494 時(shí)間: 2025-3-22 13:35 作者: Freeze 時(shí)間: 2025-3-22 20:10
Longest Common Rollercoasters.. We consider the problem of computing the longest common .-rollercoaster between two integer strings . and ., i.e., the longest .-rollercoaster that is a subsequence common to both . and .. We give two algorithms that solve this problem; The first runs in .(.) time and space, where .,?. are respec作者: 規(guī)范就好 時(shí)間: 2025-3-22 21:17
Minimal Unique Palindromic Substrings After Single-Character Substitutiond any proper palindromic substring of . occurs at least twice in .. MUPSs are utilized for answering the ., which is motivated by molecular biology?[Inoue et al., 2018]. Given a string . of length ., all MUPSs of . can be computed in .(.) time. In this paper, we study the problem of updating the set作者: 婚姻生活 時(shí)間: 2025-3-23 03:00 作者: 賞心悅目 時(shí)間: 2025-3-23 06:11 作者: abject 時(shí)間: 2025-3-23 11:49 作者: entitle 時(shí)間: 2025-3-23 17:07 作者: idiopathic 時(shí)間: 2025-3-23 18:48 作者: Assignment 時(shí)間: 2025-3-24 00:14 作者: GLEAN 時(shí)間: 2025-3-24 03:51 作者: LINES 時(shí)間: 2025-3-24 09:09
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search TreeThe suffix binary search tree?[Irving and Love, JDA’03] is a dynamic data structure that can answer this problem dynamically in the sense that insertions and deletions of positions in?. are allowed. While a standard binary search tree on strings needs to store two longest-common prefix (LCP) values 作者: 褻瀆 時(shí)間: 2025-3-24 13:49
: Fast and Precise Approximate Membership Querylightweight space usage explains their success, mainly as they are the only way to scale hundreds of billions or trillions of elements. However, they suffer by nature from non-avoidable false-positive calls that bias downstream analyses of methods using these data structures.. In this work we propos作者: exercise 時(shí)間: 2025-3-24 17:45
A Separation of , and , via Thue–Morse Words the size . of the smallest string attractor for . is 4 for ., this shows for the first time that there is a separation between the size of the smallest string attractor . and the size of the smallest bidirectional scheme ., i.e., there exist string families such that ..作者: 指數(shù) 時(shí)間: 2025-3-24 22:24 作者: NOTCH 時(shí)間: 2025-3-24 23:15 作者: Permanent 時(shí)間: 2025-3-25 04:31
0302-9743 ly reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology...*The symposium was held virtually..978-3-030-86691-4978-3-030-86692-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 中止 時(shí)間: 2025-3-25 07:43 作者: 馬賽克 時(shí)間: 2025-3-25 13:07 作者: CHYME 時(shí)間: 2025-3-25 16:40
Permutation-Constrained Common String Partitions with Applications the input specifies whether each matched pair of block needs to be preserved as is, or reversed. With this result on PCSP, we show that a series of genome rearrangement problems are FPT as long as the input genomes are .-occurrence.作者: cuticle 時(shí)間: 2025-3-25 23:51 作者: archenemy 時(shí)間: 2025-3-26 00:39
Grammar Index by Induced Suffix Sortingdex requires . words of space and can be built in . time using . working space, where . is the sum of the lengths of the right hand sides of all production rules. We practically evaluate that our proposed index excels at locating long patterns in highly-repetitive texts. Our implementation is available at ..作者: 憂傷 時(shí)間: 2025-3-26 07:26 作者: fixed-joint 時(shí)間: 2025-3-26 09:10 作者: enhance 時(shí)間: 2025-3-26 13:14
A Separation of , and , via Thue–Morse Words the size . of the smallest string attractor for . is 4 for ., this shows for the first time that there is a separation between the size of the smallest string attractor . and the size of the smallest bidirectional scheme ., i.e., there exist string families such that ..作者: maculated 時(shí)間: 2025-3-26 20:16
978-3-030-86691-4Springer Nature Switzerland AG 2021作者: 禁止 時(shí)間: 2025-3-26 22:10
String Processing and Information Retrieval978-3-030-86692-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: fatty-acids 時(shí)間: 2025-3-27 04:10 作者: tinnitus 時(shí)間: 2025-3-27 05:45
https://doi.org/10.1007/978-3-030-86692-1adaptive algorithms; artificial intelligence; computational linguistics; computer vision; data mining; da作者: Rotator-Cuff 時(shí)間: 2025-3-27 11:18
Christina Boucher,Davide Cenzato,Zsuzsanna Lipták,Massimiliano Rossi,Marinella Sciortino作者: 關(guān)節(jié)炎 時(shí)間: 2025-3-27 14:51 作者: Intercept 時(shí)間: 2025-3-27 20:18
Jakub Radoszewski,Wojciech Rytter,Juliusz Straszyński,Tomasz Waleń,Wiktor Zuba作者: 責(zé)怪 時(shí)間: 2025-3-27 23:06 作者: Spina-Bifida 時(shí)間: 2025-3-28 05:16
Diego Díaz-Domínguez,Gonzalo Navarro,Alejandro Pacheco作者: habitat 時(shí)間: 2025-3-28 08:11
Takumi Ideue,Takuya Mieno,Mitsuru Funakoshi,Yuto Nakashima,Shunsuke Inenaga,Masayuki Takeda作者: bonnet 時(shí)間: 2025-3-28 11:40 作者: invert 時(shí)間: 2025-3-28 17:26
Tomohiro I,Robert W. Irving,Dominik K?ppl,Lorna Love作者: 自負(fù)的人 時(shí)間: 2025-3-28 21:41
Hideo Bannai,Mitsuru Funakoshi,Tomohiro I,Dominik K?ppl,Takuya Mieno,Takaaki Nishimoto作者: FAR 時(shí)間: 2025-3-29 01:32
An LMS-Based Grammar Self-index with?Local Consistency Propertiesubstrings (Nong et al. 2009). Our grammar also requires to try . cuts when searching for ., but it does not need to store permutations. As a result, we obtain a self-index that searches in time . and is of practical size. Our experiments showed that our index is faster than previous grammar-based in作者: Hormones 時(shí)間: 2025-3-29 04:28
Computing the Original eBWT Faster, Simpler, and with Less Memoryit is the fastest method for all collections, with a maximum speedup of 7.6. on the second best method. The peak memory is at most 2. larger than the second best method. Comparing with methods that are also, as our algorithm, able to report suffix array samples, we obtain a 57.1. improvement in peak作者: fledged 時(shí)間: 2025-3-29 09:24 作者: Hyperlipidemia 時(shí)間: 2025-3-29 11:25
8樓作者: 不能平靜 時(shí)間: 2025-3-29 18:03
8樓作者: conflate 時(shí)間: 2025-3-29 21:40
9樓作者: Agnosia 時(shí)間: 2025-3-30 03:54
9樓作者: PACT 時(shí)間: 2025-3-30 05:09
9樓作者: HERE 時(shí)間: 2025-3-30 11:38
9樓作者: Cardiac 時(shí)間: 2025-3-30 13:48
10樓作者: 壟斷 時(shí)間: 2025-3-30 19:33
10樓作者: 格子架 時(shí)間: 2025-3-31 00:08
10樓作者: 發(fā)酵劑 時(shí)間: 2025-3-31 04:17
10樓
