Results 41 to 50 of about 75,062 (184)
Pan-genome de Bruijn graph using the bidirectional FM-index
Background Pan-genome graphs are gaining importance in the field of bioinformatics as data structures to represent and jointly analyze multiple genomes. Compacted de Bruijn graphs are inherently suited for this purpose, as their graph topology naturally ...
Lore Depuydt +3 more
doaj +1 more source
A Method to Detect Anomalies in Complex Socio-Technical Operations Using Structural Similarity
Traditional techniques for accident investigation have hindsight biases. Specifically, they isolate the process of the accident event and trace backward from the event to determine the factors leading to the accident.
Syed Nasir Danial +2 more
doaj +1 more source
Malware Classification based on Call Graph Clustering [PDF]
Each day, anti-virus companies receive tens of thousands samples of potentially harmful executables. Many of the malicious samples are variations of previously encountered malware, created by their authors to evade pattern-based detection.
Kinable, Joris, Kostakis, Orestis
core +1 more source
Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion
Computing the edit distance between two genomes under certain operations is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years.
Shao Mingfu, Lin Yu
doaj +1 more source
Topology Discovery of Sparse Random Graphs With Few Participants [PDF]
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants.
Anandkumar, Animashree +2 more
core +8 more sources
The outbreak and spread of COVID-19 remind us again of the devastating attack that human-to-human transmitted respiratory infectious diseases (H-HRIDs) bring to global economics and public health.
Yunxiang Zhao +7 more
doaj +1 more source
A parallel graph edit distance algorithm [PDF]
Abstract Graph edit distance (GED) has emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning, and data mining. GED is an error-tolerant graph matching problem which consists in minimizing the cost of the sequence that transforms a graph into another by means of ...
Abu-Aisheh, Zeina +3 more
openaire +1 more source
GEDEVO: An Evolutionary Graph Edit Distance Algorithm for Biological Network Alignment [PDF]
Introduction: With the so-called OMICS technology the scientific community has generated huge amounts of data that allow us to reconstruct the interplay of all kinds of biological entities.
Baumbach, Jan +3 more
core +1 more source
Offline Signature Verification by Combining Graph Edit Distance and Triplet Networks
Biometric authentication by means of handwritten signatures is a challenging pattern recognition task, which aims to infer a writer model from only a handful of genuine signatures.
A Bansal +13 more
core +1 more source
Process model comparison based on cophenetic distance [PDF]
The automated comparison of process models has received increasing attention in the last decade, due to the growing existence of process models and repositories, and the consequent need to assess similarities between the underlying processes.
A Armas-Cervantes +12 more
core +1 more source

