Sciweavers

906 search results - page 113 / 182
» Matching Subsequences in Trees
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 2 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
DOCENG
2005
ACM
13 years 11 months ago
Enhancing composite digital documents using XML-based standoff markup
Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging tract structure to detailed rendering and layout. We pres...
Peter L. Thomas, David F. Brailsford
BMCBI
2006
137views more  BMCBI 2006»
13 years 9 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
ICCV
2003
IEEE
14 years 11 months ago
Video Input Driven Animation (VIDA)
There are many challenges associated with the integration of synthetic and real imagery. One particularly difficult problem is the automatic extraction of salient parameters of na...
Meng Sun, Allan D. Jepson, Eugene Fiume
ICIP
2001
IEEE
14 years 10 months ago
A directional, shift insensitive, low-redundancy, wavelet transform
Shift variance and poor directional selectivity, two major disadvantages of the discrete wavelet transform, have previously been circumvented either by using highly redundant, non...
Rutger L. van Spaendonck, Felix C. A. Fernandes, S...