咨询与建议

限定检索结果

文献类型

  • 23 篇 期刊文献
  • 5 篇 会议

馆藏范围

  • 28 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 19 篇 工学
    • 18 篇 计算机科学与技术...
    • 6 篇 软件工程
    • 2 篇 电子科学与技术(可...
    • 1 篇 电气工程
    • 1 篇 控制科学与工程
    • 1 篇 生物工程
  • 15 篇 理学
    • 13 篇 数学
    • 2 篇 生物学
    • 1 篇 物理学
    • 1 篇 统计学(可授理学、...

主题

  • 28 篇 string algorithm
  • 4 篇 dynamic programm...
  • 3 篇 palindrome
  • 3 篇 suffix tree
  • 2 篇 pattern matching
  • 2 篇 tandem repeat
  • 2 篇 motif discovery
  • 2 篇 suffix array
  • 1 篇 maximum flow
  • 1 篇 longest subseque...
  • 1 篇 tandem
  • 1 篇 irredundant
  • 1 篇 lowest common an...
  • 1 篇 longest common s...
  • 1 篇 combinatorics
  • 1 篇 hamming distance
  • 1 篇 computational co...
  • 1 篇 longest common s...
  • 1 篇 order preserving...
  • 1 篇 text model

机构

  • 4 篇 kyushu univ dept...
  • 2 篇 texas a&m univ d...
  • 2 篇 korea aerosp uni...
  • 1 篇 ibm tj watson re...
  • 1 篇 univ tampere fac...
  • 1 篇 texas a&m univ c...
  • 1 篇 cwi
  • 1 篇 goldsmiths univ ...
  • 1 篇 univ duisburg es...
  • 1 篇 state univ new y...
  • 1 篇 infnis networks
  • 1 篇 univ seoul dept ...
  • 1 篇 vrije univ
  • 1 篇 aist computat bi...
  • 1 篇 utah state univ ...
  • 1 篇 swiss fed inst t...
  • 1 篇 univ padua dept ...
  • 1 篇 hokkaido univ ki...
  • 1 篇 yonsei univ dept...
  • 1 篇 college of compu...

作者

  • 4 篇 lee inbok
  • 3 篇 inenaga shunsuke
  • 3 篇 arslan abdullah ...
  • 2 篇 kudo mineichi
  • 2 篇 saito tomoya
  • 2 篇 takigawa ichigak...
  • 2 篇 mamitsuka hirosh...
  • 2 篇 nakashima yuto
  • 2 篇 mieno takuya
  • 2 篇 bannai hideo
  • 2 篇 nakamura atsuyos...
  • 1 篇 hyyro heikki
  • 1 篇 kim sungmin
  • 1 篇 parida laxmi
  • 1 篇 rahmann sven
  • 1 篇 sakai yoshifumi
  • 1 篇 rubinchik mikhai...
  • 1 篇 shunsuke inenaga
  • 1 篇 takeda masayuki
  • 1 篇 kim min s.

语言

  • 22 篇 英文
  • 5 篇 其他
  • 1 篇 中文
检索条件"主题词=String algorithm"
28 条 记 录,以下是1-10 订阅
排序:
Tunnel: Parallel-inducing sort for large string analytics
收藏 引用
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2023年 第1期149卷 650-663页
作者: Du, Zhihui Zhang, Sen Bader, David A. New Jersey Inst Technol Newark NJ 07102 USA State Univ New York Oneonta Oneonta NY 13820 USA
The suffix array is a crucial data structure for efficient string analysis. Over the course of twenty-six years, sequential suffix array construction algorithms have achieved O(n) time complexity and inplace sorting. ... 详细信息
来源: 评论
Solving string Problems on Graphs Using the Labeled Direct Product
收藏 引用
algorithmICA 2022年 第10期84卷 3008-3033页
作者: Rizzo, Nicola Tomescu, Alexandru, I Policriti, Alberto Univ Helsinki Dept Comp Sci Helsinki Finland Univ Udine Dept Math Comp Sci & Phys Udine Italy
Suffix trees are an important data structure at the core of optimal solutions to many fundamental string problems, such as exact pattern matching, longest common substring, matching statistics, and longest repeated su... 详细信息
来源: 评论
algorithms for Finding a Minimum Repetition Representation of a string
Algorithms for Finding a Minimum Repetition Representation o...
收藏 引用
17th International Symposium on string Processing and Information Retrieval
作者: Nakamura, Atsuyoshi Saito, Tomoya Takigawa, Ichigaku Mamitsuka, Hiroshi Kudo, Mineichi Hokkaido Univ Kita Ku Kita 14Nishi 9 Sapporo Hokkaido 0600814 Japan Kyoto Univ Inst Chem Res Uji 611 Japan
A string with many repetitions can be written compactly by replacing h-fold contiguous repetitions of substring r with (r)h. We refer to such a compact representation as a repetition representation string or RRS, by w... 详细信息
来源: 评论
Simon's congruence pattern matching
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 994卷
作者: Kim, Sungmin Ko, Sang-Ki Han, Yo -Sub Yonsei Univ Dept Comp Sci 50 Yonsei Ro Seoul 03722 South Korea Univ Seoul Dept Artificial Intelligence 163 Seoulsiripdae Ro Seoul 02504 South Korea
The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider th... 详细信息
来源: 评论
A Linear-Time algorithm for Hamming Distance with Shifts
收藏 引用
THEORY OF COMPUTING SYSTEMS 2009年 第3期44卷 349-355页
作者: Jiang, Minghui Utah State Univ Dept Comp Sci Logan UT 84322 USA
The Hamming distance with shifts was introduced by Bookstein et al. as a generalization of the traditional Hamming distance to allow a tunable degree of fuzziness when comparing two binary sequences of the same length... 详细信息
来源: 评论
Constructing Antidictionaries of Long Texts in Output-Sensitive Space
收藏 引用
THEORY OF COMPUTING SYSTEMS 2021年 第5期65卷 777-797页
作者: Ayad, Lorraine A. K. Badkobeh, Golnaz Fici, Gabriele Heliou, Alice Pissis, Solon P. Kings Coll London Dept Informat London England Goldsmiths Univ London Dept Comp London England Univ Palermo Dipartimento Matemat & Informat Palermo Italy Ecole Polytech Lab Informat Ecole Polytech Palaiseau France CWI Amsterdam Netherlands Vrije Univ Amsterdam Netherlands
A word x that is absent from a word y is called minimal if all its proper factors occur in y. Given a collection of k words y(1), ... , y(k) over an alphabet Sigma, we are asked to compute the set M-{y1,...,yk}(l) of ... 详细信息
来源: 评论
On finding a longest common palindromic subsequence
收藏 引用
THEORETICAL COMPUTER SCIENCE 2018年 710卷 29-34页
作者: Bae, Sang Won Lee, Inbok Kyonggi Univ Dept Comp Sci Suwon 443760 South Korea Korea Aerosp Univ Dept Software & Comp Engn Goyang 412791 South Korea
Recently, Chowdhury et al. [5] proposed the longest common palindromic subsequence problem. It is a variant of the well-known LCS problem, which refers to finding a palindromic LCS between two strings T-1 and T-2. In ... 详细信息
来源: 评论
A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
收藏 引用
APPLIED MATHEMATICS LETTERS 2002年 第1期15卷 11-16页
作者: Morgenstern, B GSF Natl Res Ctr Environm & Hlth Inst Biomath & Biometry D-85764 Neuherberg Germany
In the segment-based approach to sequence alignment, nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candida... 详细信息
来源: 评论
Probabilistic Arithmetic Automata and Their Applications
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2012年 第6期9卷 1737-1750页
作者: Marschall, Tobias Herms, Inke Kaltenbach, Hans-Michael Rahmann, Sven CWI Life Sci Grp NL-1098 XG Amsterdam Netherlands Univ Bielefeld Genome Informat Grp Fac Technol D-33594 Bielefeld Germany Swiss Fed Inst Technol Computat Syst Biol Grp Dept Biosyst Sci & Engn CH-4058 Basel Switzerland Univ Duisburg Essen Fac Med Inst Human Genet D-45122 Essen Germany
We present a comprehensive review on probabilistic arithmetic automata (PAAs), a general model to describe chains of operations whose operands depend on chance, along with two algorithms to numerically compute the dis... 详细信息
来源: 评论
Irredundant tandem motifs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 525卷 89-102页
作者: Parida, Laxmi Pizzi, Cinzia Rombo, Simona E. IBM TJ Watson Res Ctr Ossining NY USA Univ Padua Dept Informat Engn I-35100 Padua Italy Univ Palermo Dept Math & Comp Sci I-90133 Palermo Italy
Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques proposed to extract irredundant motifs are not suitable when... 详细信息
来源: 评论