咨询与建议

限定检索结果

文献类型

  • 100 篇 期刊文献
  • 28 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 95 篇 工学
    • 91 篇 计算机科学与技术...
    • 16 篇 软件工程
    • 11 篇 电气工程
    • 6 篇 电子科学与技术(可...
    • 4 篇 信息与通信工程
    • 1 篇 仪器科学与技术
    • 1 篇 生物工程
    • 1 篇 网络空间安全
  • 65 篇 理学
    • 63 篇 数学
    • 2 篇 统计学(可授理学、...
    • 1 篇 化学
    • 1 篇 生物学
  • 8 篇 管理学
    • 8 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 2 篇 法学
    • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 文学
    • 1 篇 新闻传播学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 128 篇 design and analy...
  • 19 篇 pattern matching
  • 14 篇 combinatorial al...
  • 8 篇 approximation al...
  • 7 篇 parallel algorit...
  • 6 篇 pattern discover...
  • 6 篇 computational ge...
  • 6 篇 pattern matching...
  • 6 篇 nonstandard patt...
  • 5 篇 dynamic programm...
  • 4 篇 string matching
  • 4 篇 interval graphs
  • 4 篇 intersection gra...
  • 4 篇 permutation grap...
  • 3 篇 irredundant moti...
  • 3 篇 theory of comput...
  • 3 篇 graph algorithms
  • 3 篇 hamming distance
  • 3 篇 subtree isomorph...
  • 3 篇 algorithms

机构

  • 8 篇 bar ilan univ de...
  • 5 篇 bar ilan univ de...
  • 5 篇 natl cheng kung ...
  • 5 篇 toyohashi univ t...
  • 4 篇 georgia inst tec...
  • 4 篇 georgia inst tec...
  • 4 篇 georgia inst tec...
  • 4 篇 kushiro natl col...
  • 3 篇 tel aviv univ sa...
  • 3 篇 vidyasagar univ ...
  • 3 篇 univ haifa dept ...
  • 3 篇 natl cheng kung ...
  • 3 篇 ibm corp thomas ...
  • 3 篇 kushiro natl col...
  • 3 篇 purdue univ dept...
  • 2 篇 vidyasagar univ ...
  • 2 篇 univ tsukuba dep...
  • 2 篇 univ padua dipar...
  • 2 篇 tech univ catalo...
  • 2 篇 univ salerno dip...

作者

  • 9 篇 lewenstein m
  • 8 篇 amir a
  • 8 篇 hsieh sun-yuan
  • 8 篇 apostolico alber...
  • 7 篇 faro simone
  • 6 篇 apostolico a
  • 6 篇 pal madhumangal
  • 5 篇 masuyama shigeru
  • 5 篇 cantone domenico
  • 5 篇 porat e
  • 5 篇 honma hirotoshi
  • 4 篇 nakajima yoko
  • 4 篇 pal m
  • 4 篇 amir amihood
  • 3 篇 kaplan h
  • 3 篇 giaquinta emanue...
  • 3 篇 shamir r
  • 3 篇 tagliacollo clau...
  • 3 篇 porat ely
  • 3 篇 landau gm

语言

  • 109 篇 英文
  • 19 篇 其他
检索条件"主题词=Design and Analysis of Algorithms"
128 条 记 录,以下是51-60 订阅
排序:
An Efficient Algorithm for Approximate Pattern Matching with Swaps
An Efficient Algorithm for Approximate Pattern Matching with...
收藏 引用
14th Prague Stringology Conference (PSC)
作者: Campanelli, Matteo Cantone, Domenico Faro, Simone Giaquinta, Emanuele Univ Catania Scuola Super Catania I-95123 Catania Italy
The Pattern Matching problern with Swaps consists in finding all occurrences of a pattern P in a text T, when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one... 详细信息
来源: 评论
Pattern Matching with Swaps for Short Patterns in Linear Time
Pattern Matching with Swaps for Short Patterns in Linear Tim...
收藏 引用
35th Conference on Current Trends in Theory and Practice of Computer Science
作者: Cantone, Domenico Faro, Sinione Univ Catania Dipartimento Matemat & Informat I-95125 Catania Italy
The Pattern Matching problem with Swaps consists in finding all occurrences of a, pattern P in a text T, when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one... 详细信息
来源: 评论
A New Algorithm for Efficient Pattern Matching with Swaps
A New Algorithm for Efficient Pattern Matching with Swaps
收藏 引用
20th International Workshop on Combinatorial algorithms (IWOCA)
作者: Campanelli, Matteo Cantone, Domenico Faro, Simone Univ Catania Scuola Super Catania Via San Nullo 5-I I-95123 Catania Italy Univ Catania Dipt Matemat Informat I-95124 Catania Italy
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text;T, when disjoint local swaps in the pattern are allowed. In this paper, we present a new efficient algorithm for the... 详细信息
来源: 评论
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
收藏 引用
Electronic Notes in Discrete Mathematics 2009年 34卷 335-339页
作者: Doerr, Benjamin Fouz, Mahmoud Max-Planck-Institut für Informatik D-66123 Saarbrücken Germany Universität des Saarlandes D-66123 Saarbrücken Germany
We give a time-randomness tradeoff for the quasi-random rumour spreading protocol proposed by Doerr et al [Doerr, B., T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In Proc. of the 19th Annual ACM-SIAM S... 详细信息
来源: 评论
ASK NOT WHAT STRINGOLOGY CAN DO FOR YOU: ADVANCES IN PATTERN MATCHING DRIVEN BY COMPUTATIONAL BIOLOGY
收藏 引用
COMMUNICATIONS IN INFORMATION AND SYSTEMS 2009年 第3期9卷 235-252页
作者: Apostolico, Alberto Univ Padua Padua Italy Georgia Inst Technol Atlanta GA 30332 USA Univ Padua Dipartimento Ingn Informaz Padua Italy Georgia Inst Technol Coll Comp Atlanta GA 30318 USA
Molecular biology has posed a number of fascinating and sometimes daunting computational problems, which came naturally expressed in its native language of character strings. Through the years, some such problems have... 详细信息
来源: 评论
On the algorithmic aspects of discrete and lexicographic Helly-type theorems and the discrete LP-type model
收藏 引用
SIAM JOURNAL ON COMPUTING 2008年 第1期38卷 1-45页
作者: Halman, Nir MIT Dept Civil & Environm Engn Cambridge MA 02139 USA
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in R-d have a common point, there is a point common to all of the objects in the set. In discrete Helly theorems the common ... 详细信息
来源: 评论
Motif patterns in 2D
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1期390卷 40-55页
作者: Apostolico, Alberto Parida, Laxmi Rombo, Simona E. Univ Calabria DEIS I-87036 Arcavacata Di Rende Italy Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Padua Dept Informat Engn I-35131 Padua Italy IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA
Motif patterns consisting of sequences of intermixed solid and don't-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In or... 详细信息
来源: 评论
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2 log n) time
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第2-3期408卷 106-115页
作者: Apostolico, Alberto Tagliacollo, Claudia Accademia Nazl Lincei Rome Italy Georgia Inst Technol Coll Comp Atlanta GA 30318 USA
Compact bases formed by motifs called "irredundant" and capable of generating all other motifs in a sequence have been proposed in recent years and successfully tested in tasks of biosequence analysis and cl... 详细信息
来源: 评论
Improved algorithms and complexity results for power domination in graphs
收藏 引用
ALGORITHMICA 2008年 第2期52卷 177-202页
作者: Guo, Jiong Niedermeier, Rolf Raible, Daniel Univ Jena Inst Informat D-07743 Jena Germany Univ Trier Abt Informat Wirtschaftsinformat Fachbereich 4 D-54286 Trier Germany
The NP-complete POWER DOMINATING SET problem is an "electric power networks variant" of the classical domination problem in graphs: Given an undirected graph G = (V, E), find a minimum-size set P. V such tha... 详细信息
来源: 评论
Finding a maximum-density path in a tree under the weight and length constraints
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第5期105卷 202-205页
作者: Hsieh, Sun-Yuan Cheng, Chih-Sheng Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 70101 Taiwan
Let T = (V, E) be a tree with n nodes such that each node v is associated with a value-weight pair (val(v), w(v)), where the value val(v) is a real number and the weight w(v) is a positive integer. The density of a pa... 详细信息
来源: 评论