Results 71 to 80 of about 206,716 (316)
Algorithms, 2019 We study two problems in computational phylogenetics. The first is tree compatibility. The input is a collection of phylogenetic trees over different partially-overlapping sets of species.
David Fernández-Baca, Lei Liu
doaj +1 more source
A Genetic Algorithm for the Maximum 2–Packing Set Problem
International Journal of Applied Mathematics and Computer Science, 2020 Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality.
Trejo-Sánchez Joel Antonio +2 more
doaj +1 more source
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
, 1997 We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints.
Magnús M. Halldórsson +3 more
core +1 more source
On the predictibility of A-minor motifs from their local contexts
RNA Biology, 2022 This study investigates the importance of the structural context in the formation of a type I/II A-minor motif. This very frequent structural motif has been shown to be important in the spatial folding of RNA molecules.
Coline Gianfrotta +4 more
doaj +1 more source
Graph pebbling algorithms and Lemke graphs
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles A. Cusack +3 more
openaire +4 more sources
Liquid biopsy‐based diagnostic evaluation of hypermethylated CpG sites for ovarian cancer diagnosis
Molecular Oncology, EarlyView.This schematic outlines the workflow from biomarker identification to duplex MethyLight assay validation for epithelial ovarian cancer diagnosis using cfDNA‐based liquid biopsy. Initial screening of hypermethylated CpG candidates (cg02957270, cg10061138 cg00480298, COL2A1) was performed in tissue using ARMS‐PCR, COBRA, qPCR and image analysis. Selected
Deepa Bisht +3 more
wiley +1 more source
This is a Reprint of one of the first Special Issues of Algorithms ever published. It focuses on the theoretical and practical performance of algorithms for solving computational problems involving graphs.
core +1 more source
, 2014 We study the complexity of turning a given graph, by edge editing, into a target graph whose critical-clique graph is any fixed graph. The problem came up in practice, in an effort of mining huge word similarity graphs for well structured word clusters.
Damaschke, Peter, +3 more
core +1 more source