Explicit Path CGR: Maintaining Sequence Fidelity in Geometric Representations

• URL: http://arxiv.org/abs/2509.18408v2
• Date: Wed, 24 Sep 2025 08:27:02 GMT
• Title: Explicit Path CGR: Maintaining Sequence Fidelity in Geometric Representations
• Abstract summary: We present a novel information-preserving Chaos Game Representation (CGR) method, also called Reverse-CGR (R-CGR)<n>Our method introduces complete sequence recovery through explicit path encoding combined with rational arithmetic precision control.<n>We demonstrate the effectiveness of R-CGR on biological sequence classification tasks, achieving competitive performance compared to traditional sequence-based methods.
• Score: 5.237172334460829
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We present a novel information-preserving Chaos Game Representation (CGR) method, also called Reverse-CGR (R-CGR), for biological sequence analysis that addresses the fundamental limitation of traditional CGR approaches - the loss of sequence information during geometric mapping. Our method introduces complete sequence recovery through explicit path encoding combined with rational arithmetic precision control, enabling perfect sequence reconstruction from stored geometric traces. Unlike purely geometric approaches, our reversibility is achieved through comprehensive path storage that maintains both positional and character information at each step. We demonstrate the effectiveness of R-CGR on biological sequence classification tasks, achieving competitive performance compared to traditional sequence-based methods while providing interpretable geometric visualizations. The approach generates feature-rich images suitable for deep learning while maintaining complete sequence information through explicit encoding, opening new avenues for interpretable bioinformatics analysis where both accuracy and sequence recovery are essential.

Related papers

• Multi-Scale Reversible Chaos Game Representation: A Unified Framework for Sequence Classification [4.970277730082774]
  We introduce a novel encoding framework, Multi-Scale Chaos Game Representation (MS-RCGR)<n>MS-RCGR transforms biological sequences into multi-resolution geometric representations with guaranteed reversibility.<n>Our results indicate that MS-RCGR provides a flexible, interpretable, and high-performing foundation for biological sequence analysis.
  arXiv  Detail & Related papers  (2026-04-20T16:28:28Z)
• Sequence-to-Image Transformation for Sequence Classification Using Rips Complex Construction and Chaos Game Representation [4.517933493143604]
  This paper introduces a novel approach that transforms molecular sequences into images by combining Chaos Game Representation and Rips complex construction.<n>Our method maps sequence elements to 2D coordinates via CGR, computes pairwise distances, and constructs Rips complexes to capture both local structural and global topological features.
  arXiv  Detail & Related papers  (2025-12-10T22:46:15Z)
• RGE-GS: Reward-Guided Expansive Driving Scene Reconstruction via Diffusion Priors [54.81109375939306]
  RGE-GS is a novel expansive reconstruction framework that synergizes diffusion-based generation with reward-guided Gaussian integration.<n>We propose a reward network that learns to identify and prioritize consistently generated patterns prior to reconstruction phases.<n>During the reconstruction process, we devise a differentiated training strategy that automatically adjust Gaussian optimization progress according to scene converge metrics.
  arXiv  Detail & Related papers  (2025-06-28T08:02:54Z)
• CP$^2$: Leveraging Geometry for Conformal Prediction via Canonicalization [51.716834831684004]
  We study the problem of conformal prediction (CP) under geometric data shifts.<n>We propose integrating geometric information--such as geometric pose--into the conformal procedure to reinstate its guarantees.
  arXiv  Detail & Related papers  (2025-06-19T10:12:02Z)
• Sequence Analysis Using the Bezier Curve [3.9052860539161918]
  We introduce a novel approach to transform sequences into images using the B'ezier curve concept for element mapping.<n> Mapping the elements onto a curve enhances the sequence information representation in the respective images.
  arXiv  Detail & Related papers  (2025-03-18T15:40:46Z)
• Flexible Mesh Segmentation via Reeb Graph Representation of Geometrical and Topological Features [0.0]
  This paper presents a new mesh segmentation method that integrates geometrical and topological features through a flexible Reeb graph representation.<n>The algorithm consists of three phases: construction of the Reeb graph using the improved topological skeleton approach, topological simplification of the graph by cancelling critical points while preserving essential features, and generation of contiguous segments via an adaptive region-growth process.
  arXiv  Detail & Related papers  (2024-12-05T23:04:45Z)
• Contrastive Graph Condensation: Advancing Data Versatility through Self-Supervised Learning [47.74244053386216]
  Graph condensation is a promising solution to synthesize a compact, substitute graph of the large-scale original graph. We introduce Contrastive Graph Condensation (CTGC), which adopts a self-supervised surrogate task to extract critical, causal information from the original graph. CTGC excels in handling various downstream tasks with a limited number of labels, consistently outperforming state-of-the-art GC methods.
  arXiv  Detail & Related papers  (2024-11-26T03:01:22Z)
• Associative Knowledge Graphs for Efficient Sequence Storage and Retrieval [0.9786690381850353]
  Associative Knowledge Graphs (AKGs) offer a promising approach by leveraging graph structures to encode sequences.<n>This study introduces a novel structural approach for sequence storage and retrieval.<n>With broad applications in computational neuroscience and bioinformatics, the approach offers scalable solutions for sequence-based memory tasks.
  arXiv  Detail & Related papers  (2024-11-19T13:00:31Z)
• Online Graph Topology Learning via Time-Vertex Adaptive Filters: From Theory to Cardiac Fibrillation [37.69303106863453]
  We introduce AdaCGP, a sparsity-aware adaptive algorithm for dynamic graph topology estimation.<n>AdaCGP consistently outperforms state-of-the-art methods.<n>It tracks dynamic changes in propagation patterns more effectively than established methods.
  arXiv  Detail & Related papers  (2024-11-03T13:43:51Z)
• Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition [49.41718583061147]
  Graph condensation is a data-centric solution to replace the large graph with a small yet informative condensed graph.<n>Existing GC methods suffer from intricate optimization processes, necessitating excessive computing resources and training time.<n>We propose a training-free GC framework termed Class-partitioned Graph Condensation (CGC)<n>CGC condenses the Ogbn-products graph within 30 seconds, achieving a speedup ranging from $102$X to $104$X and increasing accuracy by up to 4.2%.
  arXiv  Detail & Related papers  (2024-05-22T14:57:09Z)
• UGMAE: A Unified Framework for Graph Masked Autoencoders [67.75493040186859]
  We propose UGMAE, a unified framework for graph masked autoencoders. We first develop an adaptive feature mask generator to account for the unique significance of nodes. We then design a ranking-based structure reconstruction objective joint with feature reconstruction to capture holistic graph information.
  arXiv  Detail & Related papers  (2024-02-12T19:39:26Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• Structure-Aware Human-Action Generation [126.05874420893092]
  Graph convolutional networks (GCNs) are promising way to leverage structure information to learn structure representations. We propose a variant of GCNs to leverage the powerful self-attention mechanism to adaptively sparsify a complete action graph in the temporal space. Our method could dynamically attend to important past frames and construct a sparse graph to apply in the GCN framework, well-capturing the structure information in action sequences.
  arXiv  Detail & Related papers  (2020-07-04T00:18:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.