Cover Image

A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Singhvi, Vivaan, Wagner, Joey, Dolson, Emily, Zaman, Luis, Moreno, Matthew Andres
Format:	Preprint
Published:	2025
Subjects:	Neural and Evolutionary Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Trackable Agent-based Evolution Models at Wafer Scale
by: Moreno, Matthew Andres, et al.
Published: (2024)

Trackable Island-model Genetic Algorithms at Wafer Scale
by: Moreno, Matthew Andres, et al.
Published: (2024)

A Guide to Tracking Phylogenies in Parallel and Distributed Agent-based Evolution Models
by: Moreno, Matthew Andres, et al.
Published: (2024)

Convergence and Running Time of Time-dependent Ant Colony Algorithms
by: Manthey, Bodo, et al.
Published: (2025)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
by: Yang, Connor, et al.
Published: (2025)

Multi-Neuron Representations of Hierarchical Concepts in Spiking Neural Networks
by: Lynch, Nancy A.
Published: (2024)

Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints
by: Liu, Dan-Xuan, et al.
Published: (2024)

Extending a Phylogeny-based Method for Detecting Signatures of Multi-level Selection for Applications in Artificial Life
by: Moreno, Matthew Andres, et al.
Published: (2025)

Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams
by: Moreno, Matthew Andres, et al.
Published: (2024)

The Runtime of Random Local Search on the Generalized Needle Problem
by: Doerr, Benjamin, et al.
Published: (2024)

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
by: Bendahi, Abderrahim, et al.
Published: (2025)

How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
by: Doerr, Benjamin, et al.
Published: (2023)

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
by: Doerr, Benjamin, et al.
Published: (2023)

Learning to Approximate Uniform Facility Location via Graph Neural Networks
by: Qian, Chendi, et al.
Published: (2026)

Hyper-Heuristics Can Profit From Global Variation Operators
by: Doerr, Benjamin, et al.
Published: (2024)

Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
by: Doerr, Benjamin, et al.
Published: (2022)

Which Algorithms Can Graph Neural Networks Learn?
by: Wittig, Solveig, et al.
Published: (2026)

Ecology, Spatial Structure, and Selection Pressure Induce Strong Signatures in Phylogenetic Structure
by: Moreno, Matthew Andres, et al.
Published: (2024)

Phylotrack: C++ and Python libraries for in silico phylogenetic tracking
by: Dolson, Emily, et al.
Published: (2024)

Runtime phylogenetic analysis enables extreme subsampling for test-based problems
by: Lalejini, Alexander, et al.
Published: (2024)

Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
by: Zhang, Taining, et al.
Published: (2023)

Reachability Analysis for Lexicase Selection via Community Assembly Graphs
by: Dolson, Emily, et al.
Published: (2023)

On the Robustness of Lexicase Selection to Contradictory Objectives
by: Shahbandegan, Shakiba, et al.
Published: (2024)

Abstraction in Neural Networks
by: Lynch, Nancy
Published: (2024)

Algorithms for Efficient, Compact Online Data Stream Curation
by: Moreno, Matthew Andres, et al.
Published: (2024)

Training Neural Networks is NP-Hard in Fixed Dimension
by: Froese, Vincent, et al.
Published: (2023)

Covered Forest: Fine-grained generalization analysis of graph neural networks
by: Vasileiou, Antonis, et al.
Published: (2024)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
by: Doerr, Benjamin, et al.
Published: (2022)

Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
by: Hertrich, Christoph, et al.
Published: (2021)

Stringology-Based Motif Discovery from EEG Signals: an ADHD Case Study
by: Dahan, Anat, et al.
Published: (2026)

Predictive Spike Timing Enables Distributed Shortest Path Computation in Spiking Neural Networks
by: Storesund, Simen, et al.
Published: (2025)

Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks
by: Li, Jianfei, et al.
Published: (2024)

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
by: Doerr, Benjamin, et al.
Published: (2026)

Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
by: Moreno, Matthew Andres, et al.
Published: (2024)

mmore500/hstrat-reconstruction-algo: v1.0.1
by: Matthew Andres Moreno, et al.
Published: (2025)

Demonstrating the Advantages of Analog Wafer-Scale Neuromorphic Hardware
by: Schmidt, Hartmut, et al.
Published: (2024)

Wafer2Spike: Spiking Neural Network for Wafer Map Pattern Classification
by: Mishra, Abhishek, et al.
Published: (2024)

The Trie Measure, Revisited
by: Alanko, Jarno N., et al.
Published: (2025)

ECLIPSE: An Evolutionary Computation Library for Instrumentation Prototyping in Scientific Engineering
by: Foreback, Max, et al.
Published: (2026)