REVIEW
BLANT: Basic Local Alignment of Network Topology, Part 1: Seeding local alignments with unambiguous 8-node graphlets
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
Signed reviews
read the original abstract
BLAST is a standard tool in bioinformatics for creating local sequence alignments using a "seed-and-extend" approach. Here we introduce an analogous seed-and-extend algorithm that produces local network alignments: BLANT, for Basic Local Alignment of Network Topology. This paper introduces BLANT-seed: given an input graph, BLANT-seed uses network topology alone to create a limited, high-specificity index of k-node induced subgraphs called k-graphlets (analogous to BLASTS's k-mers). The index is constructed so that, if significant common network topology exists between two graphs, their indexes are likely to overlap. BLANT-seed then queries the indexes of two networks to generate a list of common k-graphlets which, when paired, form a seed pair. Our companion paper (submitted elsewhere) describes BLANT-extend, which "grows" these seeds to larger local alignments, again using only topological information.
Discussion (0). Continue with ORCID to comment.