Results 271 to 280 of about 131,326 (303)

Computation by Self-assembly of DNA Graphs

Genetic Programming and Evolvable Machines, 2003
Using three dimensional graph structure and DNA self-assembly we show that theoretically 3-SAT and 3-colorability can be solved in a constant number of laboratory steps. In this assembly, junction molecules and duplex DNA molecules are the basic building blocks. The graphs involved are not necessarily regular, so experimental results of self-assembling
Natasa Jonoska, Phiset Sa-Ardyen, Nadrian C. Seeman   +2 more
openaire   +1 more source

Workshop: Graph compression approaches in assembly

2012 IEEE 2nd International Conference on Computational Advances in Bio and medical Sciences (ICCABS), 2012
Using a probabilistic data structure to store DNA assembly graphs results in a significant memory savings over other methods. As long as the Bloom filter remains below a specific false positive rate, it remains possible to traverse the graph. Using a Bloom filter has many applications in metagenomics, mRNAseq, read filtering, and error correction.
Jason Pell, Arend Hintze, Rosangela Canino-Koning, Adina Howe, James M. Tiedje, C. Titus Brown   +5 more
openaire   +1 more source

Scalable Assembly for Massive Genomic Graphs

2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2017
Scientists increasingly want to assemble large genomes, metagenomes, and large numbers of individual genomes. In order to meet the demand for processing these huge datasets, parallel genome assembly is a vital step. Among all the parallel genome assemblers, de Bruijn graph based ones are most popular.
Jintao Meng 0001, Ning Guo, Jianqiu Ge, Yanjie Wei, Pavan Balaji, Bingqiang Wang   +5 more
openaire   +1 more source

Generation of assembly graphs by systematic analysis of assembly structures

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Substructure Assembling Network for Graph Classification

Proceedings of the AAAI Conference on Artificial Intelligence, 2018
Graphs are natural data structures adopted to represent real-world data of complex relationships. In recent years, a surge of interest has been received to build predictive models over graphs, with prominent examples in chemistry, computational biology, and social networks.
Xiaohan Zhao, Bo Zong, Ziyu Guan, Kai Zhang, Wei Zhao 0019   +4 more
openaire   +1 more source

A graph model for face-to-face assembly

Proceedings, 1989 International Conference on Robotics and Automation, 2003
The authors briefly recapitulate the face-to-face composition (FFC) model for the representation and manipulation of topological and geometric entities. They then summarize L.S. Homem de Mello's and A. Sanderson's (1988) proposal for assembly planning. It is shown that the assembly AND/OR graph proposed by L.S. Homem de Mello and A.
Leila De Floriani, George Nagy
openaire   +1 more source

Systematic generation of assembly precedence graphs

Proceedings of the 1994 IEEE International Conference on Robotics and Automation, 2002
In this paper, the authors present a complete method allowing a systematic generation of assembly precedence graphs for mechanical products. The generated precedence graphs can be used as the input data of different assembly line design methods such as line balancing.
Ke Chen, Jean-Michel Henrioud
openaire   +1 more source

Assembly sequences, assembly constraints, precedence graphs

Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003., 2004
In this paper, the authors present a critical discussion on relations between assembly constraints, assembly sequences and precedence graphs and a method to generate precedence graphs from any given set of assembly sequences. It is demonstrated that it is generally impossible to encompass assembly constraints for any product into a single precedence ...
J.-M. Henrioud, L. Relange, C. Perrard
openaire   +1 more source

On assembly of four-connected graphs

1993
A set of operations on 4-connected graphs is introduced in which only line addition and vertex splitting are involved. It is shown that every 4-connected graph can be assembled from either the complete graph K5 or the double-axle wheel W 4 2 on four vertices using only these operations, with 4-connectivity preserved.
Jianer Chen, Arkady Kanevsky
openaire   +1 more source

On aggregation in multiset-based self-assembly of graphs

Natural Computing, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Bernardini, Robert Brijder, Matteo Cavaliere, Giuditta Franco, Hendrik Jan Hoogeboom, Grzegorz Rozenberg   +5 more
openaire   +2 more sources