找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Combinatorial Pattern Matching; 12th Annual Symposiu Gad M. Landau,Amihood Amir Conference proceedings 2001 Springer-Verlag Berlin Heidelbe

[復制鏈接]
樓主: 全體
41#
發(fā)表于 2025-3-28 15:37:52 | 只看該作者
Chien Hung Wu,Rung Shiang Cheng,Chi Han Chen algorithm is .. + .. This is the first algorithm for motif discovery with a proven output sensitive complexity bound. The discovery algorithm works in two phases: in the first phase it detects a linear number of core motifs in time polynomial in the input size n and in the second phase it detects a
42#
發(fā)表于 2025-3-28 20:42:50 | 只看該作者
43#
發(fā)表于 2025-3-28 23:55:00 | 只看該作者
Lu Xu,Li Jianwei,Jiang Hao,Luo Dan,Cao Hanhe LZ78 and LZW variants. Given a text of length . compressed into length ., and a pattern of length ., we report all the . occurrences of the pattern in the text in .. + mn + Rmlogm) worst case time. On average this drops to .. + (n + R) logm) or O(m. + n+Ru=n) for most regular expressions. This is
44#
發(fā)表于 2025-3-29 03:53:25 | 只看該作者
https://doi.org/10.1007/978-3-030-73562-3rs is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. Experimental results show an improvement in compression and time over standard methods.
45#
發(fā)表于 2025-3-29 07:42:10 | 只看該作者
https://doi.org/10.1007/978-3-030-73562-3the problem of computing the longest common subsequence (LCS) between two strings of length . and ., compressed to . and . runs. We extend an existing algorithm for the LCS to the Levenshtein distance achieving . complexity. This approach gives also an algorithm for approximate searching of a patter
46#
發(fā)表于 2025-3-29 13:21:20 | 只看該作者
Maggie Cheng,Peng Yu,Huibin Jiaon-chip memory start to diminish?.Parallel computing has been a strategic area of growth for computer science since the 1940s. So far, parallel computing affected main stream computer science only in a limited way. The key problem with parallel computers has been their programmability..The parallel
47#
發(fā)表于 2025-3-29 18:58:22 | 只看該作者
https://doi.org/10.1007/978-3-030-73562-3 on a string ....... .. that acts like an oracle on the set of factors ..... ... If a string is recog- nized by this automaton, it may be a factor of .. But, if it is rejected, it is surely not a factor. We call it factor oracle. More precisely, this au- tomaton is acyclic, recognizes at least the f
48#
發(fā)表于 2025-3-29 22:22:38 | 只看該作者
49#
發(fā)表于 2025-3-30 00:13:26 | 只看該作者
50#
發(fā)表于 2025-3-30 04:38:07 | 只看該作者
Wenye Wang,Fengzhe Dai,Fei Jiang,Zhichang Li= gcd(.). Here we study the case of long periods, namely ., for which we construct recursively a sequence of integers . ≥ 2, such that ., up to a certain prefix of ., has these numbers as periods. We further compute the maximum alphabet size . of A over which a word with long periods can exist, and
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-19 09:23
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
泊头市| 环江| 通州市| 嘉祥县| 高青县| 札达县| 阿勒泰市| 南江县| 新安县| 乌兰浩特市| 南华县| 宁安市| 酒泉市| 旬邑县| 中卫市| 屯昌县| 惠东县| 会同县| 崇仁县| 阿荣旗| 德阳市| 上虞市| 江孜县| 固始县| 广平县| 工布江达县| 河东区| 东兰县| 凤台县| 大田县| 汉中市| 高青县| 大竹县| 伊金霍洛旗| 新河县| 缙云县| 连州市| 台南县| 桐乡市| 高唐县| 兴安县|