Results 291 to 300 of about 652,005 (320)
Some of the next articles are maybe not open access.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
Phylogenetic trees correspond one-to-one to compatible systems of splits and so splits play an important role in theoretical and computational aspects of phylogeny. Whereas any tree reconstruction method can be thought of as producing a compatible system of splits, an increasing number of phylogenetic algorithms are available that compute split systems
Andreas W M, Dress, Daniel H, Huson
openaire +2 more sources
Phylogenetic trees correspond one-to-one to compatible systems of splits and so splits play an important role in theoretical and computational aspects of phylogeny. Whereas any tree reconstruction method can be thought of as producing a compatible system of splits, an increasing number of phylogenetic algorithms are available that compute split systems
Andreas W M, Dress, Daniel H, Huson
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1988
The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This concept is at the core of a new bounding technique for graph covering problems and has furnished the best known bounds for the problem of perfect hashing.The basis of the technique is the sub-additivity of graph entropy ...
KORNER, JANOS, K. Marton
openaire +1 more source
The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This concept is at the core of a new bounding technique for graph covering problems and has furnished the best known bounds for the problem of perfect hashing.The basis of the technique is the sub-additivity of graph entropy ...
KORNER, JANOS, K. Marton
openaire +1 more source
Theoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asahiro, Yuichi +4 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asahiro, Yuichi +4 more
openaire +1 more source
Eccentricity splitting graph of a graph
Journal of Discrete Mathematical Sciences and Cryptography, 2021Let G = (V, E) be any connected graph with for all uj, uk ∈ Si if e(uj) = e(uk)(1 ≤ i ≤ t) with each | Si|≥ 2 and .
Nivedha Baskar +2 more
openaire +1 more source
On $$\alpha $$-Split Domination in Graphs
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 2022In this paper, we present the concept of alpha-split domination in graphs. Besides, we calculate the alpha-split domination number of path, cycle, complete bipartite graphs and discuss the upper bounds for a-split domination number in terms of order p, size q and the maximum degree d.
S. Amutha +4 more
openaire +3 more sources
A split prime editor with untethered reverse transcriptase and circular RNA template
Nature Biotechnology, 2022Bin Liu, Haoyang Cheng, Zexiang Chen
exaly
Microbial single-cell RNA sequencing by split-pool barcoding
Science, 2021Anna Kuchina +2 more
exaly