咨询与建议

限定检索结果

文献类型

  • 43 篇 期刊文献
  • 15 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 54 篇 工学
    • 51 篇 计算机科学与技术...
    • 7 篇 软件工程
    • 5 篇 电气工程
    • 2 篇 力学(可授工学、理...
    • 2 篇 信息与通信工程
    • 1 篇 控制科学与工程
  • 26 篇 理学
    • 25 篇 数学
    • 2 篇 生物学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 3 篇 医学
    • 2 篇 临床医学
    • 1 篇 基础医学(可授医学...
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...
  • 2 篇 法学
    • 2 篇 法学

主题

  • 58 篇 compressed data ...
  • 6 篇 text indexing
  • 5 篇 string searching
  • 4 篇 pattern matching
  • 4 篇 lempel-ziv compr...
  • 3 篇 indexing
  • 3 篇 document retriev...
  • 3 篇 suffix trees
  • 3 篇 burrows-wheeler ...
  • 3 篇 parallel computi...
  • 3 篇 repetitive strin...
  • 2 篇 succinct and com...
  • 2 篇 succinct data st...
  • 2 篇 full-text indexi...
  • 2 篇 social networks
  • 2 篇 range minimum qu...
  • 2 篇 string databases
  • 2 篇 top-k queries
  • 2 篇 suffix arrays
  • 2 篇 bioinformatics

机构

  • 12 篇 univ chile dept ...
  • 4 篇 univ helsinki de...
  • 3 篇 univ kansas dept...
  • 2 篇 univ chile dept ...
  • 2 篇 univ concepcion ...
  • 2 篇 univ chile ctr b...
  • 2 篇 univ helsinki de...
  • 2 篇 yahoo res latin ...
  • 2 篇 cebib santiago
  • 2 篇 dalhousie univ f...
  • 2 篇 univ waterloo ch...
  • 2 篇 univ pisa dept c...
  • 2 篇 diego portales u...
  • 2 篇 univ a coruna da...
  • 2 篇 univ pisa dipart...
  • 2 篇 kyushu univ dept...
  • 1 篇 cornershop santi...
  • 1 篇 univ tubingen ct...
  • 1 篇 univ tecn federi...
  • 1 篇 aalto univ dept ...

作者

  • 24 篇 navarro gonzalo
  • 6 篇 makinen veli
  • 5 篇 munro j. ian
  • 5 篇 arroyuelo diego
  • 5 篇 nekrich yakov
  • 5 篇 gagie travis
  • 4 篇 vitter jeffrey s...
  • 4 篇 prezza nicola
  • 3 篇 vinciguerra gior...
  • 3 篇 manzini giovanni
  • 3 篇 brisaboa nieves ...
  • 3 篇 ferragina paolo
  • 3 篇 fischer johannes
  • 3 篇 valimaki niko
  • 3 篇 thankachan sharm...
  • 2 篇 claude francisco
  • 2 篇 boffa antonio
  • 2 篇 inenaga shunsuke
  • 2 篇 siren jouni
  • 2 篇 puglisi simon j.

语言

  • 53 篇 英文
  • 5 篇 其他
检索条件"主题词=Compressed Data Structures"
58 条 记 录,以下是51-60 订阅
排序:
A parallel subdomain by subdomain implementation of the implicitly restarted Arnoldi/Lanczos method
收藏 引用
COMPUTATIONAL MECHANICS 2011年 第5期48卷 563-577页
作者: Ainsworth, G. O., Jr. Ribeiro, F. L. B. Magluta, C. COPPE Univ Fed Rio de Janeiro Programa Engn Civil BR-21945970 Rio De Janeiro Brazil
This work presents a parallel implementation of the implicitly restarted Arnoldi/Lanczos method for the solution of eigenproblems approximated by the finite element method. The implicitly restarted Arnoldi/Lanczos use... 详细信息
来源: 评论
Wee LCP
收藏 引用
INFORMATION PROCESSING LETTERS 2010年 第8-9期110卷 317-320页
作者: Fischer, Johannes Karlsruhe Inst Technol D-76128 Karlsruhe Germany
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the suffix array, o(n) additional bits are suf... 详细信息
来源: 评论
Practical approaches to reduce the space requirement of Lempel-Ziv-based compressed text indices
收藏 引用
ACM Journal of Experimental Algorithmics 2010年 第1期15卷 1.1–1.54页
作者: Arroyuelo, Diego Navarro, Gonzalo Yahoo Research Chile Blanco Encalada 2120 Santiago Chile Department of Computer Science University of Chile Blanco Encalada 2120 Santiago Chile
Given a text T[1..n] over an alphabet of size σ, the full-text search problem consists in locating the occ occurrences of a given pattern P[1..m] in T. compressed full-text self-indices are space-efficient representa... 详细信息
来源: 评论
Faster entropy-bounded compressed suffix trees
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第51期410卷 5354-5364页
作者: Fischer, Johannes Makinen, Veli Navarro, Gonzalo Univ Chile Dept Comp Sci Santiago Chile Univ Helsinki Dept Comp Sci FIN-00014 Helsinki Finland Univ Tubingen Ctr Bioinformat ZBIT D-72074 Tubingen Germany
Suffix trees are among the most important data structures in stringology, with a number of applications in flourishing areas like bioinformatics. Their main problem is space usage, which has triggered much research st... 详细信息
来源: 评论
Rank/select on dynamic compressed sequences and applications
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第43期410卷 4414-4422页
作者: Gonzalez, Rodrigo Navarro, Gonzalo Univ Chile Dept Comp Sci Santiago Chile
Operations rank and select over a sequence of symbols have many applications to the design of succinct and compressed data structures managing text collections, structured text, binary relations, trees, graphs, and so... 详细信息
来源: 评论
Storage and Retrieval of Individual Genomes
收藏 引用
13th Annual International Conference on Research Computational Molecular Biology
作者: Makinen, Veli Navarro, Gonzalo Siren, Jouni Valimaki, Niko Univ Helsinki Dept Comp Sci Helsinki Finland Univ Chile Dept Comp Sci Santiago Chile
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Examples of such collections are version con... 详细信息
来源: 评论
Rank and select revisited and extended
收藏 引用
THEORETICAL COMPUTER SCIENCE 2007年 第3期387卷 332-347页
作者: Makinen, Veli Navarro, Gonzalo Univ Chile Dept Comp Sci Ctr Web Res Santiago Chile Univ Helsinki Dept Comp Sci FIN-00014 Helsinki Finland
The deep connection between the Burrows-Wheeler transform (BWT) and the so-called rank and select data structures for symbol sequences is the basis of most successful approaches to compressed text indexing. Rank of a ... 详细信息
来源: 评论
compressed suffix arrays and suffix trees with applications to text indexing and string matching
收藏 引用
SIAM JOURNAL ON COMPUTING 2005年 第2期35卷 378-407页
作者: Grossi, R Vitter, JS Univ Pisa Dipartimento Informat I-56127 Pisa Italy Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Duke Univ Durham NC 27706 USA
The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as... 详细信息
来源: 评论