Sciweavers

583 search results - page 27 / 117
» New algorithms for efficient parallel string comparison
Sort
View
DATE
2008
IEEE
105views Hardware» more  DATE 2008»
15 years 6 months ago
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
Miroslav N. Velev, Ping Gao 0002
TCBB
2011
14 years 6 months ago
Graph Comparison by Log-Odds Score Matrices with Application to Protein Topology Analysis
A TOPS diagram is a simplified description of the topology of a protein using a graph where nodes are α-helices and β-strands, and edges correspond to chirality relations and p...
J. Rocha
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 12 days ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
BMCBI
2010
139views more  BMCBI 2010»
14 years 12 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
IPPS
2005
IEEE
15 years 5 months ago
High-Performance Direct Pairwise Comparison of Large Genomic Sequences
Many applications in Comparative Genomics lend themselves to implementations that take advantage of common high-performance features in modern microprocessors. However, the common...
Christopher Mueller, Mehmet M. Dalkilic, Andrew Lu...