• WebGraph

  • Referenced in 55 articles [sw30097]
  • WebGraph is a framework for graph compression aimed at studying web graphs. It provides simple ... ways to manage very large graphs, exploiting modern compression techniques. More precisely, it is currently ... detailed mathematical analysis. Algorithms for compressing web graphs that exploit gap compression and referentiation ... compression ratio. Algorithms for accessing a compressed graph without actually decompressing it, using lazy techniques...
  • BBMCSP

  • Referenced in 10 articles [sw17718]
  • when dealing with sparse graphs some form of compression is required. The new algorithm...
  • SplitMEM

  • Referenced in 2 articles [sw30182]
  • analyzes multiple individuals together. A compressed de Bruijn graph is a sophisticated data structure ... relationships between suffix trees and compressed de Bruijn graphs and introduce an algorithm, splitMEM, that ... directly constructs the compressed de Bruijn graph in time and space linear to the total...
  • Mayfly

  • Referenced in 2 articles [sw09233]
  • array-based data structures such as compressed matrices, graphs, heaps, and trees. The Mayfly pattern...
  • PhaseCode

  • Referenced in 4 articles [sw21399]
  • PhaseCode: fast an efficient compressive phase retrieval based on sparse-graph codes...
  • M-GCAT

  • Referenced in 1 article [sw22997]
  • based multiple genome comparison using a compressed suffix graph and thus can construct multiple genome...
  • DSJM

  • Referenced in 6 articles [sw12532]
  • graph remains invariant for one-sided, two-sided, full column, and column-segments compression algorithms.The ... large-scale test instances (see Graph Models and their efficient implementation for sparse Jacobian matrix...
  • DARRC

  • Referenced in 2 articles [sw29709]
  • compression by encoding the sequences of a pan-genome as a guided de Bruijn Graph ... full decompression of the archive. DARRC can compress both single-end and paired-end read...
  • khmer

  • Referenced in 0 articles [sw17093]
  • counting data structure, a compressible De Bruijn graph representation, De Bruijn graph partitioning, and digital...
  • PathGraph

  • Referenced in 1 article [sw41764]
  • graph parallel computation is developed in the PathGraph system. Concretely, we employ delta-compression ... PathGraph by comparing with recent representative graph processing systems such as GraphChi and X-Stream...
  • Rainbowfish

  • Referenced in 2 articles [sw33131]
  • uses BOSS to represent the de Bruijn graph, but decomposes the color sets based ... these color sets. The Rainbowfish representation is compressed based on the (0)th-order entropy...
  • GIFgraph

  • Referenced in 1 article [sw39737]
  • would recommend that you use GD::Graph directly. I also do not recommend ... childish about their patent on LZW compression...
  • ATC

  • Referenced in 1 article [sw39352]
  • truncation. Several techniques are proposed to improve compression rate, speed, memory usage and error control ... Ripoll et al., IEEE Trans. Visual. Comput. Graph., 2020]. We derive a novel expression ... Householder-reflector-based approach is proposed to compress the orthogonal Tucker factors. Certain key improvements...
  • GenomeTools

  • Referenced in 0 articles [sw37843]
  • annotation graphs and to integrate it into larger workflows, simultaneously accessing compressed sequence data ... well as random access to the annotation graph, but also facilitates the creation of bindings...
  • RMol

  • Referenced in 2 articles [sw33262]
  • data collections with R libraries for analyzing graphs. Associated with the RMol objects ... sets by storing R objects in bz-compressed serialized files instead of employing RData files...
  • TripleBit

  • Referenced in 1 article [sw27337]
  • directly and efficiently query the RDF graph. This motivates us to design a compact storage ... reduce the size of indexes (e.g., through compression techniques) but also minimize the number...
  • GraphBPT

  • Referenced in 1 article [sw13121]
  • tree is achieved efficiently with data compression techniques, and a textual representation ... empowering the BPT with its equivalent factor graph. The relevance of GraphBPT is illustrated...
  • LIBSVX

  • Referenced in 1 article [sw32971]
  • namely, spatiotemporal uniformity, object/region boundary detection, region compression and parsimony. For the evaluation we propose ... conclusive evidence that the hierarchical graph-based (GBH), segmentation by weighted aggregation (SWA) and temporal ... best potential for region compression; and TSP achieves the best undersegmentation error...
  • bytescircle

  • Referenced in 0 articles [sw17782]
  • contained in a file as a circle graph of deviations from mean in sigma increments ... shown as a green centered crown, compressed and encrypted files should be shown as equally...
  • AMD

  • Referenced in 60 articles [sw00039]
  • Algorithm 837: AMD is a set of routines...