254 research outputs found
Non-Koszulness of operads and positivity of Poincaré series
We prove that the operad of mock partially associative -ary algebras is not Koszul, as conjectured by the second and the third author in 2009, and utilise Zeilbergerâs algorithm for hypergeometric summation to demonstrate that non-Koszulness of that operad for n = 8 cannot be established by hunting for negative coeïŹcients in the inverse of its PoincarĂ© series
Coadjoint Orbits of Lie Algebras and Cartan Class
We study the coadjoint orbits of a Lie algebra in terms of Cartan class. In fact, the tangent space to a coadjoint orbit O(α) at the point α corresponds to the characteristic space associated to the left invariant form α and its dimension is the even part of the Cartan class of α. We apply this remark to determine Lie algebras such that all the nontrivial orbits (nonreduced to a point) have the same dimension, in particular when this dimension is 2 or 4. We determine also the Lie algebras of dimension 2n or 2n+1 having an orbit of dimension 2n
Global alignment of protein-protein interaction networks by graph matching methods
Aligning protein-protein interaction (PPI) networks of different species has
drawn a considerable interest recently. This problem is important to
investigate evolutionary conserved pathways or protein complexes across
species, and to help in the identification of functional orthologs through the
detection of conserved interactions. It is however a difficult combinatorial
problem, for which only heuristic methods have been proposed so far. We
reformulate the PPI alignment as a graph matching problem, and investigate how
state-of-the-art graph matching algorithms can be used for that purpose. We
differentiate between two alignment problems, depending on whether strict
constraints on protein matches are given, based on sequence similarity, or
whether the goal is instead to find an optimal compromise between sequence
similarity and interaction conservation in the alignment. We propose new
methods for both cases, and assess their performance on the alignment of the
yeast and fly PPI networks. The new methods consistently outperform
state-of-the-art algorithms, retrieving in particular 78% more conserved
interactions than IsoRank for a given level of sequence similarity.
Availability:http://cbio.ensmp.fr/proj/graphm\_ppi/, additional data and codes
are available upon request. Contact: [email protected]: Preprint versio
Recommended from our members
Soft topographic map for clustering and classification of bacteria
In this work a new method for clustering and building a
topographic representation of a bacteria taxonomy is presented. The method is based on the analysis of stable parts of the genome, the so-called âhousekeeping genesâ. The proposed method generates topographic maps of the bacteria taxonomy, where relations among different
type strains can be visually inspected and verified. Two well known DNA alignement algorithms are applied to the genomic sequences. Topographic maps are optimized to represent the similarity among the sequences according to their evolutionary distances. The experimental analysis is carried out on 147 type strains of the Gammaprotebacteria
class by means of the 16S rRNA housekeeping gene. Complete sequences of the gene have been retrieved from the NCBI public database. In the experimental tests the maps show clusters of homologous type strains and present some singular cases potentially due to incorrect classification
or erroneous annotations in the database
Gene-oriented ortholog database: a functional comparison platform for orthologous loci
The accumulation of complete genomic sequences enhances the need for functional annotation. Associating existing functional annotation of orthologs can speed up the annotation process and even examine the existing annotation. However, current protein sequence-based ortholog databases provide ambiguous and incomplete orthology in eukaryotes. It is because that isoforms, derived by alternative splicing (AS), often share higher sequence similarity to interfere the sequence-based identification. Gene-Oriented Ortholog Database (GOOD) employs genomic locations of transcripts to cluster AS-derived isoforms prior to ortholog delineation to eliminate the interference from AS. From the gene-oriented presentation, isoforms can be clearly associated to their genes to provide comprehensive ortholog information and further be discriminated from paralogs. Aside from, displaying clusters of isoforms between orthologous genes can present the evolution variation at the transcription level. Based on orthology, GOOD additionally comprises functional annotation from the Gene Ontology (GO) database. However, there exist redundant annotations, both parent and child terms assigned to the same gene, in the GO database. It is difficult to precisely draw the numerical comparison of term counts between orthologous genes annotated with redundant terms. Instead of the description only, GOOD further provides the GO graphs to reveal hierarchical-like relationships among divergent functionalities. Therefore, the redundancy of GO terms can be examined, and the context among compared terms is more comprehensive. In sum, GOOD can improve the interpretation in the molecular function from experiments in the model organism and provide clear comparative genomic annotation across organisms
Realizing a deep reinforcement learning agent discovering real-time feedback control strategies for a quantum system
To realize the full potential of quantum technologies, finding good strategies to control quantum information processing devices in real time becomes increasingly important. Usually these strategies require a precise understanding of the device itself, which is generally not available. Model-free reinforcement learning circumvents this need by discovering control strategies from scratch without relying on an accurate description of the quantum system. Furthermore, important tasks like state preparation, gate teleportation and error correction need feedback at time scales much shorter than the coherence time, which for superconducting circuits is in the microsecond range. Developing and training a deep reinforcement learning agent able to operate in this real-time feedback regime has been an open challenge. Here, we have implemented such an agent in the form of a latency-optimized deep neural network on a field-programmable gate array (FPGA). We demonstrate its use to efficiently initialize a superconducting qubit into a target state. To train the agent, we use model-free reinforcement learning that is based solely on measurement data. We study the agentâs performance for strong and weak measurements, and for three-level readout, and compare with simple strategies based on thresholding. This demonstration motivates further research towards adoption of reinforcement learning for real-time feedback control of quantum devices and more generally any physical system requiring learnable low-latency feedback control
- âŠ