咨询与建议

限定检索结果

文献类型

  • 100 篇 期刊文献
  • 48 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 127 篇 工学
    • 123 篇 计算机科学与技术...
    • 30 篇 软件工程
    • 8 篇 电气工程
    • 4 篇 控制科学与工程
    • 2 篇 信息与通信工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 测绘科学与技术
    • 1 篇 生物工程
    • 1 篇 网络空间安全
  • 74 篇 理学
    • 70 篇 数学
    • 3 篇 生物学
    • 1 篇 物理学
    • 1 篇 化学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...

主题

  • 150 篇 string algorithm...
  • 16 篇 suffix trees
  • 15 篇 pattern matching
  • 11 篇 combinatorial pr...
  • 8 篇 palindromes
  • 7 篇 longest common s...
  • 7 篇 approximate stri...
  • 6 篇 word-level paral...
  • 6 篇 approximation al...
  • 6 篇 parikh vectors
  • 6 篇 data structures
  • 6 篇 dynamic programm...
  • 6 篇 edit distance
  • 5 篇 parallel algorit...
  • 5 篇 hamming distance
  • 5 篇 burrows-wheeler ...
  • 5 篇 suffix sorting
  • 5 篇 suffix array
  • 5 篇 combinatorics on...
  • 4 篇 repetitions

机构

  • 11 篇 cwi
  • 9 篇 vrije univ
  • 9 篇 kings coll londo...
  • 7 篇 univ helsinki de...
  • 7 篇 bar ilan univ de...
  • 7 篇 kyushu univ dept...
  • 7 篇 univ cent florid...
  • 5 篇 univ cent florid...
  • 4 篇 univ wisconsin d...
  • 4 篇 louisiana state ...
  • 4 篇 johns hopkins un...
  • 4 篇 univ haifa cri i...
  • 4 篇 kings coll londo...
  • 3 篇 univ warsaw inst...
  • 3 篇 univ eastern fin...
  • 3 篇 bar ilan univ de...
  • 3 篇 lodz univ techno...
  • 3 篇 shenkar coll dep...
  • 3 篇 univ warwick dep...
  • 3 篇 facebook inc men...

作者

  • 18 篇 pissis solon p.
  • 10 篇 inenaga shunsuke
  • 8 篇 amir amihood
  • 7 篇 loukides grigori...
  • 7 篇 charalampopoulos...
  • 7 篇 bannai hideo
  • 7 篇 thankachan sharm...
  • 7 篇 grabowski szymon
  • 6 篇 sweering michell...
  • 6 篇 takeda masayuki
  • 6 篇 giaquinta emanue...
  • 6 篇 liptak zsuzsanna
  • 6 篇 bernardini giuli...
  • 6 篇 stougie leen
  • 5 篇 fici gabriele
  • 5 篇 ganguly arnab
  • 5 篇 abedin paniz
  • 5 篇 nakashima yuto
  • 5 篇 mieno takuya
  • 5 篇 thankachan sharm...

语言

  • 133 篇 英文
  • 17 篇 其他
检索条件"主题词=string algorithms"
150 条 记 录,以下是111-120 订阅
LCS approximation via embedding into locally non-repetitive strings
收藏 引用
INFORMATION AND COMPUTATION 2011年 第4期209卷 705-716页
作者: Landau, G. M. Levy, A. Newman, I. Shenkar Coll Dept Software Engn Ramat Gan Israel Univ Haifa Dept Comp Sci IL-31905 Haifa Israel Univ Haifa CRI IL-31905 Haifa Israel NYU Poly MetroTech Ctr 6 Dept Comp Sci & Engn Brooklyn NY 11201 USA
A classical measure of similarity between strings is the length of the longest common subsequence (LCS) between the two given strings. The search for efficient algorithms for finding the LCS has been going on for more... 详细信息
来源: 评论
Fully Compressed Suffix Trees
收藏 引用
ACM TRANSACTIONS ON algorithms 2011年 第4期7卷 1–34页
作者: Russo, Luis M. S. Navarro, Gonzalo Oliveira, Arlindo L. INESC ID P-1000029 Lisbon Portugal Univ Tecn Lisboa Inst Super Tecn P-1049001 Lisbon Portugal Univ Chile Dept Comp Sci Santiago Chile
Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like bioinformatics and information retrieval. Classical representations of suffix trees require Theta(... 详细信息
来源: 评论
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access
Finding Shuffle Words That Represent Optimal Scheduling of S...
收藏 引用
5th International Conference on Language and Automata Theory and Applications
作者: Reidenbach, Daniel Schmid, Markus L. Univ Loughborough Dept Comp Sci Loughborough LE11 3TU Leics England
In the present paper, we introduce and study the problem of computing, for any given finite set of words, a shuffle word with a minimum so-called scope coincidence degree. The scope coincidence degree is the maximum n... 详细信息
来源: 评论
Finding a longest open reading frame of an alternatively spliced gene
Finding a longest open reading frame of an alternatively spl...
收藏 引用
IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)
作者: Moore, Neil Jaromczyk, Jerzy Wl. Univ Kentucky Dept Comp Sci Lexington KY 40506 USA
This paper provides a deterministic algorithm for finding a longest open reading frame (ORF) among all alternative splicings of a given DNA sequence. Finding protein encoding regions is a fundamental problem in genomi... 详细信息
来源: 评论
Finding the maximum suffix with fewer comparisons
收藏 引用
JOURNAL OF DISCRETE algorithms 2011年 第3期9卷 279-286页
作者: Franceschini, Gianni Hagerup, Torben Univ Roma La Sapienza Dipartimento Informat Rome Italy Univ Augsburg Inst Informat D-86135 Augsburg Germany
It is shown how to compute the lexicographically maximum suffix of a string of n >= 2 characters over a totally ordered alphabet using at most (4/3) n - 5/3 three-way character comparisons. The best previous bound,... 详细信息
来源: 评论
A filtering algorithm for k-mismatch with don't cares
收藏 引用
INFORMATION PROCESSING LETTERS 2010年 第22期110卷 1021-1025页
作者: Clifford, Raphael Porat, Ely Univ Bristol Dept Comp Sci Bristol BS8 1UB Avon England Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel
We present a filtering based algorithm for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols in either p or t (but not bot... 详细信息
来源: 评论
Pattern matching with don't cares and few errors
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2010年 第2期76卷 115-124页
作者: Clifford, Raphael Efremenko, Klim Porat, Ely Rothschild, Amir Univ Bristol Dept Comp Sci Bristol BS8 1UB Avon England Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Weizmann Inst Sci IL-76100 Rehovot Israel
We present solutions for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the plac... 详细信息
来源: 评论
Weighted LCS
收藏 引用
JOURNAL OF DISCRETE algorithms 2010年 第3期8卷 273-281页
作者: Amir, Amihood Gotthilf, Zvi Shalom, B. Riva Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA
The Longest Common Subsequence (LCS) of two strings A, B is a well studied problem having a wide range of applications. When each symbol of the input strings is assigned a positive weight the problem becomes the Heavi... 详细信息
来源: 评论
Finding the Maximum Suffix with Fewer Comparisons
Finding the Maximum Suffix with Fewer Comparisons
收藏 引用
7th International Conference on algorithms and Complexity
作者: Franceschini, Gianni Hagerup, Torben Univ Roma La Sapienza Dipartimento Informat Rome Italy Univ Augsburg Inst Informat Augsburg Germany
It is shown how to compute the lexicographically maximum suffix of a string of n >= 2 characters over a totally ordered alphabet using at most (4/3)n - 5/3 three-way character comparisons. The best previous hot id.... 详细信息
来源: 评论
Searching for Jumbled Patterns in strings
Searching for Jumbled Patterns in Strings
收藏 引用
14th Prague stringology Conference (PSC)
作者: Cicalese, Ferdinando Fici, Gabriele Liptak, Zsuzsanna Univ Salerno Dipartimento Informat & Applicaz Salerno Italy
The Parikh vector of a string s over a finite ordered alphabet Sigma = {a1 , ...., a sigma} is defined as the vector of multiplicities of the characters, i.e. p(s) = (p(1) , ...., p(sigma)), where p(i) = vertical bar{... 详细信息
来源: 评论