Sciweavers

148 search results - page 19 / 30
» Constructing Big Trees from Short Sequences
Sort
View
IWPC
2008
IEEE
15 years 5 months ago
The Reuse of Grammars with Embedded Semantic Actions
Reusing syntax specifications without embedded arbitrary semantic actions is straightforward because the semantic analysis phases of new applications can feed off trees or other ...
Terence Parr
WABI
2004
Springer
100views Bioinformatics» more  WABI 2004»
15 years 4 months ago
Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data
In the last few years, it has become routine to use gene-order data to reconstruct phylogenies, both in terms of edge distances (parsimonious sequences of operations that transform...
Joel V. Earnest-DeYoung, Emmanuelle Lerat, Bernard...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 4 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
CANDC
2005
ACM
15 years 28 days ago
The development of a cybernetic sculptor: Edward Ihnatowicz and the senster
Edward Ihnatowicz (1926-1988) built one of the world’s first computer-controlled robotic sculptures, The Senster, in 196870. Rather than concentrate entirely on this groundbreak...
Aleksandar Zivanovic
BMCBI
2005
133views more  BMCBI 2005»
14 years 11 months ago
Ab initio identification of putative human transcription factor binding sites by comparative genomics
Background: Understanding transcriptional regulation of gene expression is one of the greatest challenges of modern molecular biology. A central role in this mechanism is played b...
Davide Corà, Carl Herrmann, Christoph Diete...