相关论文: Micronuclear Sequences Associated with Assembly Gr…
We introduce a new concept of a subgraph class called a superbubble for analyzing assembly graphs, and propose an efficient algorithm for detecting it. Most assembly algorithms utilize assembly graphs like the de Bruijn graph or the overlap…
Gene assembly in ciliates is one of the most involved DNA processings going on in any organism. This process transforms one nucleus (the micronucleus) into another functionally different nucleus (the macronucleus). We continue the…
A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…
Diverse parallel stitched two-dimensional heterostructures are synthesized, including metal-semiconductor (graphene-MoS2), semiconductor-semiconductor (WS2-MoS2), and insulator-semiconductor (hBN-MoS2), directly through selective sowing of…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
Identifying nucleation pathway is important for understanding the kinetics of first-order phase transitions in natural systems. In the present work, we study nucleation pathway of the Ising model in homogeneous and heterogeneous networks…
The Watson-Crick complementary properties of DNA make DNA a useful tool for the self-assembly of various target complexes. Concepts from graph theory can be used to model the self-assembling process in which the vertices of the graph…
We prove that the asymptotic distribution of resonances has a multilevel internal structure for the following classes of Hamiltonians H: Schr\"odinger operators with point interactions in $\mathbb{R}^3$, quantum graphs, and 1-D photonic…
Molecular self-assembly plays a very important role in various aspects of technology as well as in biological systems. Governed by the covalent, hydrogen or van der Waals interactions - self-assembly of alike molecules results in a large…
We present an algebraic procedure for constructing Hamiltonians with several distinct partial dynamical symmetries (PDSs), of relevance to shape-coexistence phenomena. The procedure relies on a spectrum generating algebra encompassing…
Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…
We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…
We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed…
In this paper, electron microscopy images of microstructures formed on Ge surfaces by ion beam irradiation were processed to extract topological features as skeleton graphs, which were then embedded using a graph convolutional network. The…
Connections on a trivial bundle MxG can be identified with their holonomy maps, i.e. with homomorphisms of a groupoid of paths in M into the gauge group G. For a connected compact G, various algebras depending on the set of the smooth…
De novo genome assembly focuses on finding connections between a vast amount of short sequences in order to reconstruct the original genome. The central problem of genome assembly could be described as finding a Hamiltonian path through a…
In this work we develop the path integral optimization in a class of inhomogeneous 2d CFTs constructed by putting an ordinary CFT on a space with a position dependent metric. After setting up and solving the general optimization problem, we…
A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to…
Understanding the pathways by which viral capsid proteins assemble around their genomes could identify key intermediates as potential drug targets. In this work we use computer simulations to characterize assembly over a wide range of…
The sequence in which a complex product is assembled directly impacts the ease and efficiency of the assembly process, whether executed by a human or a robot. A sequence that gives the assembler the greatest freedom of movement is therefore…