Sciweavers

148 search results - page 6 / 30
» Constructing Big Trees from Short Sequences
Sort
View
98
Voted
JACM
2006
112views more  JACM 2006»
14 years 11 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
BMCBI
2006
127views more  BMCBI 2006»
14 years 11 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
97
Voted
STOC
2005
ACM
133views Algorithms» more  STOC 2005»
15 years 11 months ago
An O(log n log log n) space algorithm for undirected st-connectivity
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
Vladimir Trifonov
92
Voted
METMBS
2004
140views Mathematics» more  METMBS 2004»
15 years 8 days ago
New Techniques for Generation and Analysis of Evolutionary Trees
We introduce new distance measures for the construction and analysis of phylogenies, focusing on thioredoxin-fold proteins. Our distance measures for tree construction are based o...
Chang Wang, Stephen D. Scott, Qingping Tao, Dmitri...
DCC
2005
IEEE
15 years 10 months ago
Lossless Data Compression Using Optimal Tree Machines
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
Gergely Korodi, Jorma Rissanen, Ioan Tabus