Sciweavers

224 search results - page 28 / 45
» The Complexity of Phrase Alignment Problems
Sort
View
BIOCOMP
2007
14 years 11 days ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
NAR
2006
120views more  NAR 2006»
13 years 11 months ago
TreeDomViewer: a tool for the visualization of phylogeny and protein domain structure
Phylogenetic analysis and examination of protein domains allow accurate genome annotation and are invaluable to study proteins and protein complex evolution. However, two sequence...
Blaise T. F. Alako, Daphne Rainey, Harm Nijveen, J...
FPL
2010
Springer
188views Hardware» more  FPL 2010»
13 years 9 months ago
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
Kristian Stevens, Henry Chen, Terry Filiba, Peter ...
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 10 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
14 years 8 days ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau