Results 51 to 60 of about 75,062 (184)
Graph Edit Distance in the Exact Context [PDF]
, 2018 This paper presents a new Mixed Integer Linear Program (MILP) formulation for the Graph Edit Distance (GED) problem. The contribution is an exact method that solves the GED problem for attributed graphs. It has an advantage over the best existing one when dealing with the case of dense of graphs, because all its constraints are independent from the ...
Darwiche, Mostafa +3 more
openaire +2 more sources
Molecular Oncology, EarlyView.We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source
Vietnam Journal of Computer ScienceGraph Edit Distance (GED) computation is a fundamental yet NP-hard problem in graph theory that quantifies the structural dissimilarity between graphs through a series of edit operations.
Roya Booryaee, Ali Kamandi
doaj +1 more source
A Low Complexity Persistent Reconnaissance Algorithm for FANET
Sensors, 2022 In recent years, with the rapid progress of unmanned aerial vehicle (UAV) technology, UAV-based systems have been widely used in both civilian and military applications.
Yuan Guo, Hongying Tang, Ronghua Qin
doaj +1 more source
Molecular Oncology, EarlyView.We developed a cost‐effective methylation‐specific droplet digital PCR multiplex assay containing tissue‐conserved and tumor‐specific methylation markers. The assay can detect circulating tumor DNA with high accuracy in patients with localized and metastatic colorectal cancer.
Luisa Matos do Canto +8 more
wiley +1 more source
Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions
, 2016 Graph transformation systems have the potential to be realistic models of chemistry, provided a comprehensive collection of reaction rules can be extracted from the body of chemical knowledge. A first key step for rule learning is the computation of atom-
Flamm, Christoph +3 more
core +1 more source
Graph-Based Approach to the Edit Distance Cryptanalysis of Irregularly Clocked Linear Feedback Shift Registers [PDF]
, 2009 This paper proposes a speed-up of a known-plaintext attack on some stream ciphers based on Linear Feedback Shift Registers (LFSRs). The algorithm consists of two basic steps: first, to guess the initial seed value of one of the LFSRs, and then to use ...
Boeker, A. +8 more
core +1 more source
Molecular Oncology, EarlyView.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Representation and generation of plans using graph spectra [PDF]
, 2007 Numerical comparison of spaces with one another is often achieved with set scalar measures such as global and local integration, connectivity, etc., which capture a particular quality of the space but therefore lose much of the detail of its overall ...
Hanna, S.
core +2 more sources
Learning edit cost estimation models for graph edit distance
Pattern Recognition Letters, 2019 One of the most popular distance measures between a pair of graphs is the Graph Edit Distance. This approach consists of finding a set of edit operations that completely transforms a graph into another. Edit costs are introduced in order to penalize the distortion that each edit operation introduces.
Cortés, Xavier +2 more
openaire +3 more sources