咨询与建议

限定检索结果

文献类型

  • 26 篇 期刊文献
  • 19 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 41 篇 工学
    • 38 篇 计算机科学与技术...
    • 12 篇 软件工程
    • 5 篇 电气工程
    • 2 篇 电子科学与技术(可...
    • 1 篇 信息与通信工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 19 篇 理学
    • 16 篇 数学
    • 3 篇 生物学
  • 6 篇 医学
    • 4 篇 临床医学
    • 1 篇 基础医学(可授医学...
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 文学
    • 1 篇 外国语言文学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...
  • 1 篇 艺术学
    • 1 篇 音乐与舞蹈学

主题

  • 45 篇 grammar-based co...
  • 7 篇 tree compression
  • 6 篇 straight-line pr...
  • 5 篇 slp
  • 5 篇 approximation al...
  • 5 篇 lossless compres...
  • 4 篇 binary trees
  • 4 篇 construction of ...
  • 3 篇 compression
  • 2 篇 empirical entrop...
  • 2 篇 edit-sensitive p...
  • 2 篇 self-indexes
  • 2 篇 expression evalu...
  • 2 篇 universal source...
  • 2 篇 random access pr...
  • 2 篇 syntax
  • 2 篇 balancing
  • 2 篇 data compression
  • 2 篇 updating compres...
  • 2 篇 minimal dag repr...

机构

  • 6 篇 univ siegen sieg...
  • 3 篇 univ siegen dept...
  • 2 篇 univ wroclaw ins...
  • 2 篇 univ wroclaw wro...
  • 2 篇 hokkaido univ gr...
  • 1 篇 max planck inst ...
  • 1 篇 hyalite technol ...
  • 1 篇 univ trier fachb...
  • 1 篇 kyushu univ nish...
  • 1 篇 tokyo inst techn...
  • 1 篇 univ thessaly de...
  • 1 篇 unsw australia d...
  • 1 篇 univ wroclaw pl-...
  • 1 篇 kyushu inst tech...
  • 1 篇 univ paderborn c...
  • 1 篇 univ haifa dept ...
  • 1 篇 kyushu univ grad...
  • 1 篇 japan sci & tech...
  • 1 篇 univ siegen hold...
  • 1 篇 toho univ fac sc...

作者

  • 12 篇 lohrey markus
  • 9 篇 jez artur
  • 9 篇 hucke danny
  • 7 篇 ganardi moses
  • 6 篇 sakamoto hiroshi
  • 5 篇 maruyama shirou
  • 4 篇 benkner louisa s...
  • 4 篇 hayashida morihi...
  • 4 篇 hartel rita
  • 4 篇 boettcher stefan
  • 3 篇 akutsu tatsuya
  • 3 篇 noeth eric
  • 2 篇 nakahara masaya
  • 2 篇 bille philip
  • 2 篇 takeda masayuki
  • 2 篇 kida takuya
  • 2 篇 gagie travis
  • 2 篇 jacobs thomas
  • 2 篇 ruan peiying
  • 2 篇 maneth sebastian

语言

  • 42 篇 英文
  • 3 篇 其他
检索条件"主题词=Grammar-based compression"
45 条 记 录,以下是1-10 订阅
排序:
ITR: grammar-based graph compression supporting fast triple queries.
ITR: Grammar-based graph compression supporting fast triple ...
收藏 引用
Data compression Conference (DCC)
作者: Adler, Enno Boettcher, Stefan Hartel, Rita Paderborn Univ Paderborn Germany
Neighborhood queries are the most common queries on graphs;thus, it is desirable to answer them efficiently on compressed data structures. Our full paper [1] presents a grammar-based compressor called Incidence-Type-R... 详细信息
来源: 评论
Measuring the Similarity of Proteomes using grammar-based compression via Domain Combinations  11
Measuring the Similarity of Proteomes using Grammar-based Co...
收藏 引用
13th International Joint Conference on Biomedical Engineering Systems and Technologies
作者: Hayashida, Morihiro Koyano, Hitoshi Nacher, Jose C. Matsue Coll Natl Inst Technol Dept Elect Engn & Comp Sci Matsue Shimane Japan Tokyo Inst Technol Sch Life Sci & Technol Meguro Ku Tokyo Japan Toho Univ Fac Sci Dept Informat Sci Funabashi Chiba Japan
Revealing evolution of organisms is one of important biological research topics, and is also useful for understanding the origin of organisms. Hence, genomic sequences have been compared and aligned for finding conser... 详细信息
来源: 评论
Universal Tree Source Coding Using grammar-based compression
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2019年 第10期65卷 6399-6413页
作者: Ganardi, Moses Hucke, Danny Lohrey, Markus Benkner, Louisa Seelbach Univ Siegen Dept Elect Engn & Comp Sci D-57076 Siegen Germany
The problem of universal source coding for binary trees is considered. Zhang, Yang, and Kieffer derived upper bounds on the average-case redundancy of codes based on directed acyclic graph (DAG) compression for binary... 详细信息
来源: 评论
Universal Tree Source Coding Using grammar-based compression
Universal Tree Source Coding Using Grammar-Based Compression
收藏 引用
IEEE International Symposium on Information Theory (ISIT)
作者: Ganardi, Moses Hucke, Danny Lohrey, Markus Benkner, Louisa Seelbach Univ Siegen Dept Elect Engn & Comp Sci D-57076 Siegen Germany
The problem of universal source coding for binary trees is considered. Zhang, Yang, and Kieffer derived upper bounds on the average-case redundancy of codes based on directed acyclic graph (DAG) compression for binary... 详细信息
来源: 评论
grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAs
收藏 引用
BMC BIOINFORMATICS 2015年 第1期16卷 1-13页
作者: Zhao, Yang Hayashida, Morihiro Cao, Yue Hwang, Jaewook Akutsu, Tatsuya Kyoto Univ Inst Chem Res Bioinformat Ctr Uji Kyoto Japan
Background: Many tree structures are found in nature and organisms. Such trees are believed to be constructed on the basis of certain rules. We have previously developed grammar-based compression methods for ordered a... 详细信息
来源: 评论
Approximation of grammar-based compression via recompression
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 592卷 115-134页
作者: Jez, Artur Univ Wroclaw Inst Comp Sci PL-50383 Wroclaw Poland
In this paper we present a simple linear-time algorithm constructing a context-free grammar of size O(glog(N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar gene... 详细信息
来源: 评论
How to Find Long Maximal Exact Matches and Ignore Short Ones  1
收藏 引用
28th International Conference on Developments in Language Theory (DLT)
作者: Gagie, Travis Dalhousie Univ Fac Comp Sci Halifax NS Canada
Finding maximal exact matches (MEMs) between strings is an important task in bioinformatics, but it is becoming increasingly challenging as geneticists switch to pangenomic references. Fortunately, we are usually inte... 详细信息
来源: 评论
Revisiting the Folklore Algorithm for Random Access to grammar-Compressed Strings  31st
Revisiting the Folklore Algorithm for Random Access to Gramm...
收藏 引用
31st International Symposium on String Processing and Information Retrieval (SPIRE)
作者: Cleary, Alan M. Winjum, Joseph Dood, Jordan Inenaga, Shunsuke Natl Ctr Genome Resources Santa Fe NM USA Montana State Univ Bozeman MT 59717 USA Hyalite Technol LLC Bozeman MT USA Kyushu Univ Dept Informat Fukuoka Japan
grammar-based compression is a widely-accepted model of string compression that allows for efficient and direct manipulations on the compressed data. Most, if not all, such manipulations rely on the primitive random a... 详细信息
来源: 评论
Scalable Detection of Frequent Substrings by grammar-based compression
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2013年 第3期E96D卷 457-464页
作者: Nakahara, Masaya Maruyama, Shirou Kuboyama, Tetsuji Sakamoto, Hiroshi Kyushu Inst Technol Iizuka Fukuoka 8208502 Japan Kyushu Univ Fukuoka 8190395 Japan Gakushuin Univ Tokyo 1718588 Japan JST PRESTO Kawaguchi Saitama 3320012 Japan
A scalable pattern discovery by compression is proposed. A string is representable by a context-free grammar deriving the string deterministically. In this framework of grammar-based compression, the aim of the algori... 详细信息
来源: 评论
Balancing Straight-line Programs
收藏 引用
JOURNAL OF THE ACM 2021年 第4期68卷 1–40页
作者: Ganardi, Moses Jez, Artur Lohrey, Markus Max Planck Inst Software Syst MPI SWS Paul Ehrlich Str G 26 D-67663 Saarbrucken Germany Univ Wroclaw Ul Joliot Curie 15 PL-50383 Wroclaw Poland Univ Siegen Holderlinstr 3 D-57076 Siegen Germany
We show that a context-free grammar of size m that produces a single string w of length n (such a grammar is also called a string straight-line program) can be transformed in linear time into a context-free grammar fo... 详细信息
来源: 评论