Results 111 to 120 of about 971,776 (299)
Integrated multiple sequence alignment
, 2005 Sammeth M. Integrated multiple sequence alignment. Bielefeld (Germany): Bielefeld University; 2005.The thesis presents enhancements for automated and manual multiple sequence alignment: existing alignment algorithms are made more easily accessible and ...
Sammeth, Michael
core
A Note on Degree Sequences of Graphs [PDF]
Canadian Mathematical Bulletin, 1980 AbstractSufficient conditions for a sequence of numbers to be the degree sequence of a graph are derived from the Erdos-Gallai theorem on degree sequences of graphs.
openaire +2 more sources
The ubiquitin ligase RNF115 is required for the clearance of damaged lysosomes
FEBS Letters, EarlyView.Upon lysosomal rupture, an E3 ubiquitin ligase RNF115 translocates from the cytosol to the damaged lysosomal membrane. Moreover, RNF115 depletion impairs the clearance of damaged lysosomes, identifying it as a key regulator of lysosomal quality control.
Sae Nakanaga +3 more
wiley +1 more source
Hamiltonian-connected graphs and their strong closures
International Journal of Mathematics and Mathematical Sciences, 1997 Let G be a simple graph of order at least three. We show that G is Hamiltonian-connected if and only if its strong closure is Hamiltonian-connected. We also give an efficient algorithm to compute the strong closure of G.
Pak-Ken Wong
doaj +1 more source
The Neighbor Matrix: generalizing the degree sequence [PDF]
, 2015 The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree sequence, a ...
Gera, Ralucca M. +2 more
core
, 2007 Thirty-eight two-year-olds were trained under incidental instructions on a six element deterministic sequence of spatial locations. Following training, participants were informed of the presence of a sequence and asked to either reproduce or suppress the
Bremner, Andrew J.; id_orcid +9 more
core +1 more source
Hamiltonian degree sequences in digraphs
Journal of Combinatorial Theory, Series B, 2010 We show that for each η>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d^+_1\le ... \le d^+_n and d^- _1 \le ... \le d^-_n satisfy (i) d^+_i \geq i+ ηn or d^-_{n-i- ηn} \geq n-i and (ii) d^-_i \geq i+ ηn or d^+_{n-i- ηn} \geq n-i for all i < n/2. This gives an approximate solution to a problem of
Daniela Kühn +2 more
openaire +2 more sources
FEBS Letters, EarlyView.Embryo‐like structures (stembryos) are an innovative tool, but they are hindered by experimental variability and limited developmental potential. DNA methylation is crucial for mammalian development, but its status in stembryo models is poorly characterized.
Sara Canil +4 more
wiley +1 more source
Degree-based connected graph construction with assortativity constraint
New Journal of PhysicsDegree-based graph construction is a fundamental problem in network science. A graph is simple if there are no self-loops and no multiple links between any pair of nodes in the graph. A degree sequence $d = (d_1, d_2,\cdots, d_{N})$ is graphical if d can
Yingyue Ke, Piet Van Mieghem
doaj +1 more source
Comparing alternatives to the fixed degree sequence model for extracting the backbone of bipartite projections. [PDF]
Sci Rep, 2021 Neal ZP, Domagalski R, Sagan B.
europepmc +1 more source