Pith. sign in

REVIEW 1 cited by

Optimizing Sequence Alignment with Scored NFAs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2501.02162 v1 pith:6X5U7TM2 submitted 2025-01-04 cs.ET

Optimizing Sequence Alignment with Scored NFAs

classification cs.ET
keywords napolyarrayprocessingalignmentbestdesignelementmatch
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The rapid increase in symbolic data has underscored the significance of pattern matching and regular expression processing. While nondeterministic finite automata (NFA) are commonly used for these tasks, they are limited to detecting matches without determining the optimal one. This research expands on the NAPOLY pattern-matching accelerator by introducing NAPOLY+, which adds registers to each processing element to store variables like scores, weights, or edge costs. This enhancement allows NAPOLY+ to identify the highest score corresponding to the best match in sequence alignment tasks through the new-added arithmetic unit in each processor element. The design was evaluated against the original NAPOLY, with results showing that NAPOLY+ offers superior functionality and improved performance in identifying the best match. The design was implemented and tested on zynq102 and zynq104 FPGA devices, with performance metrics compared across array sizes from 1K to 64K processing elements. The results showed that memory usage increased proportionally with array size with Fmax decreasing as the array size grew on both platforms. The reported findings focus specifically on the core array, excluding the impact of buffers and DRAMs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Machine Learning-Based Graph Simplification for Symbolic Accelerators

    cs.LG 2026-05 unverdicted novelty 3.0

    AutoSlim uses a Random Forest model trained on prior execution features to prune redundant parts of automata graphs, reducing FPGA resources by up to 40% in symbolic accelerators with a verification check for equivalence.