Sciweavers

621 search results - page 79 / 125
» DNA Computing in Microreactors
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
ICDM
2006
IEEE
122views Data Mining» more  ICDM 2006»
14 years 2 months ago
Optimal Segmentation Using Tree Models
Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunications. Many real-life sequences have a strong segmental str...
Robert Gwadera, Aristides Gionis, Heikki Mannila
IFIP
2004
Springer
14 years 1 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
IPPS
2003
IEEE
14 years 1 months ago
Sequence Alignment on the Cray MTA-2
The standard algorithm for alignment of DNA sequences using dynamic programming has been implemented on the Cray MTA-2 (Multithreaded Architecture-2) at ENRI (Electronic Navigatio...
Shahid H. Bokhari, Jon R. Sauer
CIE
2010
Springer
14 years 28 days ago
Approximate Self-assembly of the Sierpinski Triangle
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
Jack H. Lutz, Brad Shutters