The classic in question is the Aho-Corasick algorithm, a cornerstone of computer science first published in 1975. Its genius lies in building a finite-state automaton from an entire set of search patterns at once, so that a single left-to-right pass over the text can locate every occurrence of every pattern simultaneously. For exact matching, it remains remarkably hard to beat: no preprocessing of the text is required, the automaton is built once from the patterns, and the scan proceeds at a pace independent of how many patterns are in play. That property, known as index-free operation, is precisely what makes it attractive for proteomics workflows, where the pattern set, the peptides, changes with every experiment while the text, the protein database, may be reused.

The trouble begins with wildcards. Protein databases routinely contain the ambiguity codes B, Z and X, which stand for ‘asparagine or aspartic acid’, ‘glutamine or glutamic acid’ and ‘any amino acid’, respectively. When a peptide pattern collides with one of these characters in the text, a standard Aho-Corasick automaton simply has no transition to follow, and the match is lost. Existing solutions have been unsatisfying in different ways. FM-indexes, the compressed full-text indexes popularized by genomics, can handle wildcards but demand substantial preprocessing of the text and become awkward when the wildcard sits in the searched text rather than in the pattern. Other multi-pattern methods, such as the widely used Wu-Manber algorithm, handle exact matching quickly but offer no native wildcard semantics at all.

Wild-AC’s central idea is disarmingly elegant: when the scan encounters a wildcard character in the text, it does not halt or fall back to a slow secondary routine. Instead, it branches the search into parallel ‘scout’ paths, one for each possible interpretation of the ambiguous residue, while the unmodified primary search continues unaffected through the common, wildcard-free case. Each scout carries its own state within the automaton and explores the subtree of possibilities that the wildcard opens up. Because wildcards are relatively rare, typically a few percent of database positions after standard masking, the scouts remain short-lived excursions rather than an exponential explosion. The primary automaton, meanwhile, behaves exactly like a textbook Aho-Corasick machine, so the overwhelming majority of matching work pays no wildcard tax whatsoever.

The engineering details matter as much as the concept. Wild-AC is implemented in C++ and released as open source, with support for multi-threading so that large peptide sets can be partitioned across cores. Because no index of the text is built, the algorithm starts working immediately on any database in plain sequence format, a meaningful advantage in laboratory pipelines where databases are swapped frequently, for example when searching against species-specific proteomes or contamination databases. The memory footprint stays modest, and the automaton construction scales gracefully with the number of patterns, which in practice ranges from a thousand peptides in a targeted experiment to half a million in a deep discovery run.

The benchmark results are where the algorithm earns its headline. Bielow tested Wild-AC across realistic proteomics workloads: pattern sets of 1,000 to 500,000 peptides with an average length of roughly 18 amino acids, searched against protein databases ranging from 3 million to 210 million characters. In the wildcard case, Wild-AC outperformed the FM-index outright. In pure exact matching, it matched or exceeded Wu-Manber, which is notable because Wu-Manber was designed specifically for fast multi-pattern exact search and has few peers. The advantage held across the entire realistic range of pattern counts, suggesting the algorithm is not a niche performer tuned to one benchmark configuration but a genuine workhorse.

One nuance deserves attention. When the databases were artificially masked to a wildcard rate of 5 percent, a scenario representing heavily annotated or deliberately ambiguous reference proteomes, the picture became more conditional. Wild-AC retained its advantage for large peptide sets, but the FM-index became the preferable choice for small ones. This makes intuitive sense: an index amortizes its construction cost over many queries, so if you plan to run only a handful of small searches against the same text, paying once for a prebuilt index can win. For the typical proteomics pattern of use, many peptides per search and databases that change often, Wild-AC’s index-free design tips the balance decisively the other way.

Why does this matter beyond the benchmark tables? Peptide-to-protein mapping sits at the foundation of nearly every downstream analysis in shotgun proteomics: protein identification, quantification, quality control and the detection of sequence variants all depend on it being fast and correct. Ambiguous amino acids are not an exotic edge case. They appear wherever sequences are incompletely characterized, in genomes assembled from noisy data, in databases that merge paralogous proteins, and in deliberately degenerate searches for modified or variant peptides. An algorithm that treats wildcards as a first-class citizen, without imposing index construction or sacrificing exact-search speed, removes a persistent friction from those pipelines. The author credits discussions with Sandro Andreotti on the algorithmic design and implementation input from Simon Gene Gottlieb, whose FM-index codebase and fuzzy amino acid matching implementation served as the benchmark comparison, with reviewer feedback from Ragnar Groot Koerkamp among others helping sharpen the final manuscript.

There is also a broader lesson for computational biology in how Wild-AC was built. Rather than inventing an entirely new data structure, the work takes a mature, well-understood algorithm and extends it minimally to cover a missing capability. The scout-path mechanism preserves the automaton’s behavior in the common case and pays for wildcard handling only where it is actually needed. This kind of surgical extension, validating performance against the strongest existing tools rather than straw men, is exactly the pattern that tends to produce software that gets adopted. The open-source C++ implementation, hosted publicly on GitHub, lowers the barrier for integration into existing search engines and quality-control tools, where Aho-Corasick machinery is often already present in some form.

For the proteomics community, the immediate takeaway is practical: if your pipeline maps large peptide sets against protein databases containing ambiguity codes, Wild-AC now offers the fastest known route, with no index to maintain and threads to spare. For small searches against a fixed, heavily masked database, the FM-index remains a sensible choice. For everyone else, the paper is a reminder that some of the most impactful bioinformatics advances still come from revisiting the classics of stringology and asking what happens when the text, not just the pattern, refuses to be unambiguous. As protein databases continue to swell with sequences of uneven certainty, algorithms that embrace that uncertainty at full speed will only grow in importance.

Subject of Research: A wildcard-enabled multi-pattern string matching algorithm for peptide-to-protein mapping in proteomics

Article Title: Wild-AC: A fast, index-free multi-pattern string matching algorithm with wildcard support for proteomics

Article References: Bielow, C. (2026). Wild-AC: A fast, index-free multi-pattern string matching algorithm with wildcard support for proteomics. BMC Bioinformatics. https://doi.org/10.1186/s12859-026-06686-8

Image Credits: AI Generated

DOI: 10.1186/s12859-026-06686-8

Keywords: Wild-AC, Aho-Corasick, string matching, wildcards, proteomics, peptide mapping, protein databases, FM-index, Wu-Manber, algorithms, bioinformatics, open source

The motivation behind the work lies in the convergence of two technological currents. Graph pangenomics and long-read sequencing, the authors argue, together hold the promise of integrating read mapping directly with variant calling. A single long read, spanning thousands of DNA letters in one continuous stretch, can provide strong evidence not only for single nucleotide variants but also for larger or more complex structural variations that are notoriously difficult to detect with short reads. Short-read sequencers chop the genome into fragments of a few hundred bases, and when a structural variant spans a region longer than a single fragment, the evidence is scattered and easily missed. Long reads, by contrast, can traverse an entire rearranged segment, carrying the signal for the variant within one molecule. To fully realize this potential, however, the classical algorithms used to align sequences against graphs must be extended to account for recombination events among haplotypes, all while maintaining the practical efficiency that large-scale sequencing projects demand.

Recombination is not a rare curiosity in genome biology; it is a fundamental force that reshapes chromosomes in every generation. When a read originates from a haplotype that inherited one segment from one ancestral path through the pangenome and an adjacent segment from another, an aligner that insists on a single coherent path through the graph will either misalign the read or miss the true origin altogether. Capturing such events formally is what the authors call the R-bounded Recombination-Aware Alignment Problem, abbreviated R-RAAP in the paper. The task is to find the best alignment of a query sequence to a path through a variation graph while allowing a bounded number of recombinations, that is, switches between distinct haplotype paths embedded in the graph. Solving this problem exactly with classical dynamic programming quickly becomes intractable as the number of allowed recombinations grows, because the search space of possible path combinations explodes combinatorially.

The team’s answer to this computational wall is an algorithmic strategy borrowed from artificial intelligence: the A* search framework. A* is a best-first search method that explores a space of possible solutions by prioritizing states that look most promising according to a heuristic function, an estimate of the remaining cost to reach a goal. When the heuristic is admissible, meaning it never overestimates the true remaining cost, A* is guaranteed to find an optimal solution while typically examining only a small fraction of the full search space. RecAlign applies this idea to sequence-to-graph alignment, steering the search through the variation graph toward the alignments that are most likely to be optimal and pruning away the vast regions of the search space that cannot contribute to the best answer. The result, according to the study, is an aligner that is both accurate and fast, and that can efficiently manage two or more recombination events when aligning a read against a variation graph.

The theoretical underpinnings of the work draw on a rich toolkit of combinatorial algorithms and data structures. The abbreviations section of the paper alone signals the depth of the machinery involved: dynamic programming, the longest increasing subsequence problem, the Ferragina-Manzini index better known as the FM-index, and the directed acyclic graph structure that underlies most variation graph representations. The authors also invoke the Strong Exponential Time Hypothesis, a central conjecture in computational complexity theory, which suggests that the recombination-aware alignment problem is unlikely to admit dramatically faster exact algorithms in the worst case. This complexity barrier makes the heuristic-guided pruning of A* not merely a convenience but a necessity: without a way to focus the search, exact recombination-aware alignment would remain confined to toy examples rather than chromosome-scale graphs.

Efficiency alone would not matter if the tool could not be deployed in realistic pipelines. A key contribution of the study is the integration of RecAlign into a chain-and-extend framework, an architectural pattern familiar from classical read aligners, in which short high-confidence matches are first chained together into larger anchors and the alignment is then extended around those anchors. Within this framework, the authors report that RecAlign is currently the only recombination-aware tool that can be used in practice to align long reads against chromosome-wide pangenome graphs. That distinction matters because chromosome-wide graphs, such as those built from the collections of haplotypes assembled by the Human Pangenome Reference Consortium, are precisely the scale at which modern pangenome analyses operate. Tools that can only handle gene-sized or region-sized graphs, however accurate, cannot serve as the mapping engine for whole-genome sequencing experiments.

The biological payoff of recombination-aware alignment is expected to be greatest in the most complex and clinically important regions of the genome. The paper’s list of abbreviations points to the human leukocyte antigen region and the major histocompatibility complex, the hyper-polymorphic immune loci where haplotype diversity is extreme and where short-read mapping has historically struggled most. It also references non-allelic homologous recombination, the mutational mechanism behind many recurrent structural variants, and the Graphical Fragment Assembly and Graph Alignment Format standards that allow graph-based results to flow between tools. By explicitly modeling recombinations among the haplotypes embedded in a variation graph, RecAlign can in principle place reads onto the correct combination of ancestral paths, sharpening downstream variant calling in regions where a linear reference would systematically mislead.

The work did not emerge in isolation. The authors acknowledge helpful discussions with Davide Cozzi and Simone Ciccolella during the development of the project, and the research was carried out within a substantial European funding framework. Monti, Riccardi, Della Vedova, Rizzi and Bonizzoni received support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement PANGAIA, number 872539, a network dedicated to pangenome algorithms and data structures. The work was further supported by the Horizon Europe programme under project FORGENOM II, identifier 101160008, and partially by the Italian Ministry of University and Research through the Dipartimenti di Eccellenza 2023-2027 grant of the Department of Informatics, Systems and Communication at the University of Milano-Bicocca. Bonizzoni, Della Vedova and Rizzi contributed equally to the study, reflecting a collaboration that spans algorithmic theory and practical bioinformatics engineering.

Consistent with the norms of the field, the implementation is open source and freely available on GitHub under the AlgoLab organization, in the RecGraph repository on the a_star branch, allowing other developers to inspect, reuse and extend the code. The authors declare no competing interests, and all data used in the study were either taken from public repositories or simulated, so no new human subject data were generated. The article is published open access under a Creative Commons Attribution 4.0 International license and was released as a citable, peer-reviewed accepted manuscript with a permanent DOI, subject to further editorial production before the final version of record.

For the broader genomics community, RecAlign represents a step toward a long-standing goal: mapping reads in a way that respects the true evolutionary structure of the population from which they came. As pangenome references grow to encompass ever more diverse haplotypes, and as long-read sequencing becomes routine in clinical and research settings, the algorithms that connect these technologies will determine how much of the genome’s complexity can actually be read out of the data. By showing that recombination-aware alignment can be made fast enough for chromosome-wide graphs, the Milano-Bicocca and UC Santa Cruz team has removed one of the practical obstacles standing between graph pangenomics and its everyday use, and has provided a concrete, tested tool that other groups can now build upon.

Subject of Research: Recombination-aware sequence-to-graph alignment for pangenome read mapping

Article Title: Faster and accurate recombination-aware sequence-to-graph aligner

Article References: Monti, D. C., Riccardi, B., Sirén, J., Bonizzoni, P., Della Vedova, G., & Rizzi, R. (2026). Faster and accurate recombination-aware sequence-to-graph aligner. BMC Bioinformatics. https://doi.org/10.1186/s12859-026-06640-8

Image Credits: AI Generated

DOI: 10.1186/s12859-026-06640-8

Keywords: pangenomics, variation graphs, sequence-to-graph alignment, long-read sequencing, recombination, A* search, RecAlign, BMC Bioinformatics, variant calling, FM-index, Human Pangenome Reference Consortium, computational biology