咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是71-80 订阅
排序:
Methods for Reducing Unnecessary Computation on False Mappings in Read Mapping
Methods for Reducing Unnecessary Computation on False Mappin...
收藏 引用
作者: Hongyi Xin Carnegie Mellon University
学位级别:博士
Advancements in sequencing technology have brought a large increase in the quantity of raw sequencing data. To cope with the ever growing sequence data sets, efficient read mappers are developed to accurately reconstr... 详细信息
来源: 评论
string cadences
收藏 引用
THEORETICAL COMPUTER SCIENCE 2017年 698卷 4-8页
作者: Amir, Amihood Apostolico, Alberto Gagie, Travis Landau, Gad M. Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA Georgia Inst Technol Sch Computat Sci & Engn Coll Comp Klaus Adv Comp Bldg266 Ferst Dr Atlanta GA 30332 USA Diego Portales Univ Sch Comp Sci & Telecommun Santiago Chile Univ Haifa Dept Comp Sci IL-31905 Haifa Israel NYU Tandon Sch Engn Dept Comp Sci & Engn MetroTech Ctr 2 Brooklyn NY 11201 USA
Cadences are syntactic regularities in strings, of the family of periods, squares, and repetitions. We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occu... 详细信息
来源: 评论
Faster range minimum queries
收藏 引用
SOFTWARE-PRACTICE & EXPERIENCE 2018年 第11期48卷 2043-2060页
作者: Kowalski, Tomasz M. Grabowski, Szymon Lodz Univ Technol Inst Appl Comp Sci Al Politech 11 PL-90924 Lodz Poland
y Range minimum query is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowin... 详细信息
来源: 评论
THE "RUNS" THEOREM
收藏 引用
SIAM JOURNAL ON COMPUTING 2017年 第5期46卷 1501-1514页
作者: Bannai, Hideo Tomohiro, I Inenaga, Shunsuke Nakashima, Yuto Takeda, Masayuki Tsuruta, Kazuya Kyushu Univ Dept Informat Nishi Ku Fukkuoka 8190395 Japan TU Dortmund Dept Comp Sci D-44221 Dortmund Germany Kyushu Inst Technol Dept Artificial Intelligence Fukkuoka Japan
We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture [R. M. Kolpakov and G. Kuche... 详细信息
来源: 评论
Further Improvement in Approximating the Maximum Duo-Preservation string Mapping Problem  1
收藏 引用
16th International Workshop on algorithms in Bioinformatics (WABI)
作者: Brubach, Brian Univ Maryland Dept Comp Sci College Pk MD 20742 USA
We present an improved approximation for the Maximum Duo-Preservation string Mapping Problem (MPSM). This problem was introduced in [7] as the complement to the well-studied Minimum Common string Partition problem (MC... 详细信息
来源: 评论
Inference algorithms for Pattern-Based CRFs on Sequence Data
收藏 引用
ALGORITHMICA 2016年 第1期76卷 17-46页
作者: Kolmogorov, Vladimir Takhanov, Rustem IST Austria Campus 1 A-3400 Klosterneuburg Austria Nazarbayev Univ Dept Math 53 Qabanbay Batyr Ave Astana 010000 Kazakhstan
We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) is the sum of terms over intervals [i, j] where each term is non-zero only... 详细信息
来源: 评论
algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 656卷 146-159页
作者: Amir, Amihood Apostolico, Alberto Hirst, Tirza Landau, Gad M. Lewenstein, Noa Rozenberg, Liat Bar Ilan Univ IL-52100 Ramat Gan Israel Johns Hopkins Univ Baltimore MD 21218 USA Georgia Tech Atlanta GA USA CNR IASI I-00185 Rome Italy Machon Tal Jerusalem Israel Univ Haifa IL-31999 Haifa Israel NYU New York NY 10003 USA Netanya Coll Netanya Israel
In this paper we investigate jumbled (Abelian) versions of three classical strings problems. In all these problems we assume the input string S[1..n] is given in its run-length format S'[1..r]. The Jumbled Indexin... 详细信息
来源: 评论
Generating square-free words efficiently
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 601卷 67-72页
作者: Shur, Arseny M. Ural Fed Univ Ekaterinburg Russia
We study a simple algorithm generating square-free words from a random source. The source produces uniformly distributed random letters from a k-ary alphabet, and the algorithm outputs a (k+1)-ary square-free word. We... 详细信息
来源: 评论
Approximate periodicity
收藏 引用
INFORMATION AND COMPUTATION 2015年 241卷 215-226页
作者: Amir, Amihood Eisenberg, Estrella Levy, A. Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Shenkar Coll Dept Software Engn Ramat Gan Israel Univ Haifa CRI IL-31905 Haifa Israel Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA
Finding an approximate period in a given string S of length n is defined as follows. Let S' be a periodic string closest to Sunder some distance metric, find the smallest period of S'. This period is called an... 详细信息
来源: 评论
A note on the longest common substring with k-mismatches problem
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第6-8期115卷 640-642页
作者: Grabowski, Szymon Lodz Univ Technol Inst Appl Comp Sci PL-90924 Lodz Poland
The recently introduced longest common substring with k-mismatches (k-LCF) problem is to find, given two sequences S-1 and S-2 of length n each, a longest substring A(1) of S-1 and A(2) of S-2 such that the Hamming di... 详细信息
来源: 评论