127,658 research outputs found
Graphs with the strong Havel-Hakimi property
The Havel-Hakimi algorithm iteratively reduces the degree sequence of a graph
to a list of zeroes. As shown by Favaron, Mah\'eo, and Sacl\'e, the number of
zeroes produced, known as the residue, is a lower bound on the independence
number of the graph. We say that a graph has the strong Havel-Hakimi property
if in each of its induced subgraphs, deleting any vertex of maximum degree
reduces the degree sequence in the same way that the Havel-Hakimi algorithm
does. We characterize graphs having this property (which include all threshold
and matrogenic graphs) in terms of minimal forbidden induced subgraphs. We
further show that for these graphs the residue equals the independence number,
and a natural greedy algorithm always produces a maximum independent set.Comment: 7 pages, 3 figure
PiRaNhA: A server for the computational prediction of RNA-binding residues in protein sequences
The PiRaNhA web server is a publicly available online resource that automatically predicts the location of RNA-binding residues (RBRs) in protein sequences. The goal of functional annotation of sequences in the field of RNA binding is to provide predictions of high accuracy that require only small numbers of targeted mutations for verification. The PiRaNhA server uses a support vector machine (SVM), with position-specific scoring matrices, residue interface propensity, predicted residue accessibility and residue hydrophobicity as features. The server allows the submission of up to 10 protein sequences, and the predictions for each sequence are provided on a web page and via email. The prediction results are provided in sequence format with predicted RBRs highlighted, in text format with the SVM threshold score indicated and as a graph which enables users to quickly identify those residues above any specific SVM threshold. The graph effectively enables the increase or decrease of the false positive rate. When tested on a non-redundant data set of 42 protein sequences not used in training, the PiRaNhA server achieved an accuracy of 85%, specificity of 90% and a Matthews correlation coefficient of 0.41 and outperformed other publicly available servers. The PiRaNhA prediction server is freely available at http://www.bioinformatics.sussex.ac.uk/PIRANHA. © The Author(s) 2010. Published by Oxford University Press
On One-Loop Gap Equations for the Magnetic Mass in d=3 Gauge Theory
Recently several workers have attempted determinations of the so-called
magnetic mass of d=3 non-Abelian gauge theories through a one-loop gap
equation, using a free massive propagator as input. Self-consistency is
attained only on-shell, because the usual Feynman-graph construction is
gauge-dependent off-shell. We examine two previous studies of the pinch
technique proper self-energy, which is gauge-invariant at all momenta, using a
free propagator as input, and show that it leads to inconsistent and unphysical
result. In one case the residue of the pole has the wrong sign (necessarily
implying the presence of a tachyonic pole); in the second case the residue is
positive, but two orders of magnitude larger than the input residue, which
shows that the residue is on the verge of becoming ghostlike. This happens
because of the infrared instability of d=3 gauge theory. A possible alternative
one-loop determination via the effective action also fails. The lesson is that
gap equations must be considered at least at two-loop level.Comment: 21 pages, LaTex, 2 .eps figure
Algorithm engineering for optimal alignment of protein structure distance matrices
Protein structural alignment is an important problem in computational
biology. In this paper, we present first successes on provably optimal pairwise
alignment of protein inter-residue distance matrices, using the popular Dali
scoring function. We introduce the structural alignment problem formally, which
enables us to express a variety of scoring functions used in previous work as
special cases in a unified framework. Further, we propose the first
mathematical model for computing optimal structural alignments based on dense
inter-residue distance matrices. We therefore reformulate the problem as a
special graph problem and give a tight integer linear programming model. We
then present algorithm engineering techniques to handle the huge integer linear
programs of real-life distance matrix alignment problems. Applying these
techniques, we can compute provably optimal Dali alignments for the very first
time
A combinatorial Li-Yau inequality and rational points on curves
We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field.We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms of the minimal degree of a class of graph maps, namely: one should minimize over all so-called finite harmonic graph morphisms to trees, that originate from any refinement of the dual graph of the stable model of the curve. Next comes our main result: we prove a lower bound for the degree of such a graph morphism in terms of the first eigenvalue of the Laplacian and some “volume” of the original graph; this can be seen as a substitute for graphs of the Li–Yau inequality from differential geometry, although we also prove that the strict analogue of the original inequality fails for general graphs. Finally,we apply the results to give a lower bound for the gonality of arbitraryDrinfeld modular curves over finite fields and for general congruence subgroups Γ of Γ (1) that is linear in the index [Γ (1) : Γ ], with a constant that only depends on the residue field degree and the degree of the chosen “infinite” place. This is a function field analogue of a theorem of Abramovich for classical modular curves. We present applications to uniform boundedness of torsion of rank two Drinfeld modules that improve upon existing results, and to lower bounds on the modular degree of certain elliptic curves over function fields that solve a problem of Papikian
- …