Sciweavers

44 search results - page 9 / 9
» Program quality with pair programming in CS1
Sort
View
BIOCOMP
2006
13 years 6 months ago
Finishing Repetitive Regions Automatically with Dupfinisher
Currently, the genome sequencing community is producing shotgun sequence data at a very high rate, but genome finishing is not keeping pace, even with the help from several automa...
Cliff Han, Patrick Chain
SBACPAD
2003
IEEE
120views Hardware» more  SBACPAD 2003»
13 years 9 months ago
Comparison of Genomes Using High-Performance Parallel Computing
Comparison of the DNA sequences and genes of two genomes can be useful to investigate the common functionalities of the corresponding organisms and get a better understanding of h...
Nalvo F. Almeida Jr., Carlos E. R. Alves, Edson C&...
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
13 years 8 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
13 years 10 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci