作者: frozen-shoulder 時(shí)間: 2025-3-21 22:25 作者: 領(lǐng)先 時(shí)間: 2025-3-22 01:30
Combinatorial Pattern Matching978-3-642-38905-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 終止 時(shí)間: 2025-3-22 05:56 作者: 場(chǎng)所 時(shí)間: 2025-3-22 11:45 作者: ligature 時(shí)間: 2025-3-22 16:10 作者: ligature 時(shí)間: 2025-3-22 17:05
Jerzy J. Korczak,Ilona Pawe?oszekinuous mathematics. As a discrete mathematician recently entering this domain in the context of analyzing biological images, primarily from various forms of microscopy, I have found that discrete techniques involving trees and graphs better solve some segmentation and tracking problems than their co作者: Grandstand 時(shí)間: 2025-3-23 01:08
Smart Innovation, Systems and Technologiesin strings is an important problem and therefore a well studied one in the strings community. For a given string . of length ., finding all maximal exact runs in the string can be done in .(. log.) time or .(.) time on integer alphabets. In this paper, we investigate the maximal approximate runs pro作者: 傻瓜 時(shí)間: 2025-3-23 05:23
Smart Education and e-Learning 2016raphically minimal and maximal suffixes of a given string . can be computed in linear time and space by constructing a suffix tree or a suffix array of .. Here we consider the case when . is a substring of another string . of length .. We propose two linear-space data structures for . which allow to作者: 浪蕩子 時(shí)間: 2025-3-23 07:33
University Smart Guidance Counsellingch conversion in . time, where . is the number of LZ78 codewords. This improves on the previously known . solution?[Bannai et al., SPIRE 2012]. The main tool in our algorithm is a data structure which allows us to efficiently operate on labels of the paths in a growing trie, and a certain method of 作者: HERTZ 時(shí)間: 2025-3-23 11:30 作者: 玷污 時(shí)間: 2025-3-23 16:51
Martina Hedvicakova,Libuse Svobodovant an algorithm that runs in .(.???.) expected time and uses .(.?+?.. ) space, where .???.?≤?. is the exact number of characters decompressed by the algorithm and ..?≤?.???. is the number of distinct q-grams in . . This simultaneously matches the current best known time bound and improves the best k作者: 極小 時(shí)間: 2025-3-23 20:58 作者: Corral 時(shí)間: 2025-3-24 01:25 作者: CRACY 時(shí)間: 2025-3-24 05:04 作者: Conflict 時(shí)間: 2025-3-24 07:05 作者: 支柱 時(shí)間: 2025-3-24 14:36
Johannes Fischer,Peter SandersUp-to-date results.Fast track conference proceedings.State-of-the-art report作者: 機(jī)構(gòu) 時(shí)間: 2025-3-24 16:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229990.jpg作者: Resection 時(shí)間: 2025-3-24 21:21
Jerzy J. Korczak,Ilona Pawe?oszekLCP, the Longest Common Prefix, is ubiquitous in the realm of data structures for indexing. This surprisingly simple minute definition – magically – plays a big role in Pattern Matching. We will try to understand this ”magic” by examining a couple of interesting applications.作者: Affluence 時(shí)間: 2025-3-25 01:58 作者: glucagon 時(shí)間: 2025-3-25 07:01
Conference proceedings 2013eve superior performance for the corresponding computational problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.作者: Conclave 時(shí)間: 2025-3-25 10:22 作者: projectile 時(shí)間: 2025-3-25 15:06 作者: delegate 時(shí)間: 2025-3-25 19:22 作者: 食品室 時(shí)間: 2025-3-25 22:56 作者: Crohns-disease 時(shí)間: 2025-3-26 02:08 作者: agitate 時(shí)間: 2025-3-26 04:23
Hugh Considine,Andrew Nafalski,Zorica Nedicttern is an NP-complete problem. In this work, we consider numerous parameters of this problem and for all possible combinations of these parameters, we investigate the question whether or not the variant obtained by bounding these parameters by constants can be solved efficiently.作者: LIMIT 時(shí)間: 2025-3-26 09:08 作者: 假裝是你 時(shí)間: 2025-3-26 16:13 作者: COKE 時(shí)間: 2025-3-26 20:10 作者: 受傷 時(shí)間: 2025-3-27 00:08 作者: 酷熱 時(shí)間: 2025-3-27 01:20 作者: 闡釋 時(shí)間: 2025-3-27 08:48 作者: 放棄 時(shí)間: 2025-3-27 10:59 作者: Limousine 時(shí)間: 2025-3-27 15:11 作者: MITE 時(shí)間: 2025-3-27 19:56 作者: Freeze 時(shí)間: 2025-3-27 22:30 作者: ANTI 時(shí)間: 2025-3-28 05:51 作者: 征稅 時(shí)間: 2025-3-28 10:09 作者: 用樹皮 時(shí)間: 2025-3-28 10:53
Smart Education and e-Learning 2018such that it supports access to the corresponding suffix array, and vice versa. Fourth, we introduce a variant of a position heap that can be simulated efficiently by a compressed suffix array with a linear number of extra bits.作者: stress-response 時(shí)間: 2025-3-28 16:19 作者: Connotation 時(shí)間: 2025-3-28 21:30 作者: gusher 時(shí)間: 2025-3-29 02:00 作者: 狼群 時(shí)間: 2025-3-29 06:48 作者: 草率女 時(shí)間: 2025-3-29 09:53 作者: 怪物 時(shí)間: 2025-3-29 12:37
Converting SLP to LZ78 in almost Linear Time,ch conversion in . time, where . is the number of LZ78 codewords. This improves on the previously known . solution?[Bannai et al., SPIRE 2012]. The main tool in our algorithm is a data structure which allows us to efficiently operate on labels of the paths in a growing trie, and a certain method of 作者: 出生 時(shí)間: 2025-3-29 19:02
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm,efficiency sequence alignment algorithms. In one approach, which exploits the inherent parallelism in computer logic calculations, individual cells in an alignment scoring matrix are represented as bits in a computer word and the calculation of scores is emulated by a series of bit operations compri作者: BRINK 時(shí)間: 2025-3-29 23:16 作者: Mnemonics 時(shí)間: 2025-3-30 02:47
,A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform,plicit storage for the suffix sort array and the output array, as typically required in previous work. It relies on the combinatorial properties of the ., and runs in .(..) time in the comparison model using .(1) extra memory cells, apart from the array of . cells storing the . characters of the inp作者: Gnrh670 時(shí)間: 2025-3-30 05:11
Pattern Matching with Variables: A Multivariate Complexity Analysis,by uniformly substituting the variables of . by terminal words. It is a well-known fact that deciding whether a given terminal word matches a given pattern is an NP-complete problem. In this work, we consider numerous parameters of this problem and for all possible combinations of these parameters, 作者: 做事過頭 時(shí)間: 2025-3-30 11:12 作者: 友好關(guān)系 時(shí)間: 2025-3-30 13:37
Document Listing on Repetitive Collections,preliminary work, however, on document retrieval for repetitive collections. In this paper we show how one of those indexes, the run-length compressed suffix array (RLCSA), can be extended to support document listing. In our experiments, our additional structures on top of the RLCSA can reduce the q
