This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)
Local Alignments of DNA Sequences with the Connex Array
Bucharest, Romania
August 01-August 03
ISBN: 0-7695-2690-X
ASCII Text
x 
 
Dominique Thiebaut, Gheorghe Stefan, Mihaela Malita, "Local Alignments of DNA Sequences with the Connex Array," Computing in the Global Information Technology, International Multi-Conference on, pp. 50, International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICCGI.2006.47,
author = {Dominique Thiebaut and Gheorghe Stefan and Mihaela Malita},
title = {Local Alignments of DNA Sequences with the Connex Array},
journal ={Computing in the Global Information Technology, International Multi-Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2690-X},
pages = {50},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICCGI.2006.47},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computing in the Global Information Technology, International Multi-Conference on
TI - Local Alignments of DNA Sequences with the Connex Array
SN - 0-7695-2690-X
SP
EP
A1 - Dominique Thiebaut,
A1 - Gheorghe Stefan,
A1 - Mihaela Malita,
PY - 2006
KW - null
VL - 0
JA - Computing in the Global Information Technology, International Multi-Conference on
ER -
 
Dominique Thiebaut, Smith College, Northampton, MA, USA
Gheorghe Stefan, Politehnica University of Bucharest, Romania
Mihaela Malita, St Anselm College, Manchester, NH, USA
This paper presents a heuristic for finding close to optimal solutions to the local alignment problem of two DNA sequences, and more precisely to the gene prediction problem on the Connex Array circuit, a new hierarchical parallel in-memory device. Though not optimal, the solutions generated by our algorithm compare well with those generated by other algorithms in the public domain. When aligning a probe of N symbols to a target of M symbols, the algorithm has a theoretical time complexity of O(N log(N)), with a small constant of proportionality, and requires no preprocessing of the data. However, experimental results exhibit quasi-linear time complexity.
Citation:
Dominique Thiebaut, Gheorghe Stefan, Mihaela Malita, "Local Alignments of DNA Sequences with the Connex Array," iccgi, pp.50, International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.