Sciweavers

140 search results - page 21 / 28
» String Quartets In Binary
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
13 years 5 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
DCC
2004
IEEE
14 years 7 months ago
Length-Limited Variable-to-Variable Length Codes For High-Performance Entropy Coding
Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high? performance encoding is needed. ...
Joshua G. Senecal, Mark A. Duchaineau, Kenneth I. ...
MFCS
2004
Springer
14 years 28 days ago
Generation Problems
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
Elmar Böhler, Christian Glaßer, Bernhar...
ICDAR
2003
IEEE
14 years 25 days ago
Writer Identification using Innovative Binarised Features of Handwritten Numerals
The objective of this paper is to present a number of features that can be extracted from handwritten digits and used for author verification or identification of a person’s han...
Graham Leedham, Sumit Chachra
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
13 years 11 months ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin