#35 · Genomics
Combinatorial path and block alignment formalized for pangenomes, genealogies, synteny
The dominant thread is combinatorial alignment of ordered sequence elements to structured reference objects, with each formulation defined by explicit path or block constraints. The pangenome preprint enumerates all maximal graph paths matching a given sequence chain under user-specified maximal gaps, the only item that performs direct sequence-to-graph alignment. The gene-tree preprint enumerates consistent ancestry paths linking genetic trees to genealogical pedigrees, demonstrated on the BALSAC Quebec dataset. The synteny preprint derives blocks from sequence elements without breakpoints, establishing NP-hard problems and a linear-time algorithm for collinear blocks. What is new is the explicit combinatorial formalization of these targets rather than general-purpose indexing primitives. The summaries report no benchmarks, so performance remains unverified.
Preprints
An algorithm to align a chain of sequences to paths in a pangenome graph
Introduces an algorithm that enumerates all maximal paths in a pangenome graph aligning with a given chain of sequences, allowing user-specified maximal gaps,…
Aligning gene trees with family trees
Algorithm linking genetic tree sequences to genealogical pedigree trees, enumerating consistent ancestry paths; demonstrated on the BALSAC Quebec dataset with…
On Deriving Synteny Blocks by Compacting Elements
Formal framework deriving synteny blocks from sequence elements without breakpoints; NP-hard problems, linear-time algorithm for collinear blocks minimizing…
Topic history
| Date | Rank |
|---|---|
| #35 | |
| #39 | |
| #27 | |
| #35 | |
| #15 | |
| #10 | |
| #15 | |
| #22 | |
| #10 | |
| #8 | |
| #29 | |
| #12 | |
| #19 | |
| #37 | |
| #18 | |
| #30 | |
| #11 | |
| #15 | |
| #30 | |
| #16 | |
| #18 | |
| #33 |