Sciweavers

1033 search results - page 91 / 207
» The Relative History Heuristic
Sort
View
ISBRA
2009
Springer
15 years 6 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
ACMICEC
2004
ACM
162views ECommerce» more  ACMICEC 2004»
15 years 5 months ago
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
Peter Haddawy, Namthip Rujikeadkumjorn, Khaimook D...
ALMOB
2008
82views more  ALMOB 2008»
15 years 1 days ago
Protein sequence and structure alignments within one framework
Background: Protein structure alignments are usually based on very different techniques to sequence alignments. We propose a method which treats sequence, structure and even combi...
Gundolf Schenk, Thomas Margraf, Andrew E. Torda
BMCBI
2007
233views more  BMCBI 2007»
15 years 18 hour ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
BMCBI
2008
125views more  BMCBI 2008»
15 years 18 hour ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...