使成波状
发表于 2025-3-28 14:57:22
http://reply.papertrans.cn/23/2300/229996/229996_41.png
conception
发表于 2025-3-28 21:49:02
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:57
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:45
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:20
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:11
http://reply.papertrans.cn/23/2300/229996/229996_46.png
危机
发表于 2025-3-29 16:19:51
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:18
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:08
http://reply.papertrans.cn/23/2300/229996/229996_49.png
我悲伤
发表于 2025-3-30 07:33:07
http://reply.papertrans.cn/23/2300/229996/229996_50.png