Results 101 to 110 of about 1,168 (127)
Reconfiguring Independent Sets in Cographs
, 2014 Two independent sets of a graph are adjacent if they differ on exactly one vertex (i.e. we can transform one into the other by adding or deleting a vertex). Let $k$ be an integer. We consider the reconfiguration graph $TAR_k(G)$ on the set of independent sets of size at least $k$ in a graph $G$, with the above notion of adjacency.
Bonamy, Marthe, Bousquet, Nicolas
openaire +2 more sources
Approximating the correction of weighted and unweighted orthology and paralogy relations. [PDF]
Algorithms Mol Biol, 2017 Dondi R, Lafond M, El-Mabrouk N.
europepmc +1 more source
Orthologs, turn-over, and remolding of tRNAs in primates and fruit flies. [PDF]
BMC Genomics, 2016 Velandia-Huerto CA +7 more
europepmc +1 more source
Phylogenomics with paralogs. [PDF]
Proc Natl Acad Sci U S A, 2015 Hellmuth M +5 more
europepmc +1 more source
On the consistency of orthology relationships. [PDF]
BMC Bioinformatics, 2016 Jones M, Paul C, Scornavacca C.
europepmc +1 more source
Ideally connected cographs and chordal graphs
Discrete Mathematics16 pages, 4 figures. Comments are welcome!
openaire +2 more sources
Decomposition of overlapping protein complexes: a graph theoretical method for analyzing static and dynamic protein associations. [PDF]
Algorithms Mol Biol, 2006 Zotenko E +3 more
europepmc +1 more source
A graph modification approach for finding core-periphery structures in protein interaction networks. [PDF]
Algorithms Mol Biol, 2015 Bruckner S, Hüffner F, Komusiewicz C.
europepmc +1 more source
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source