Sciweavers

148 search results - page 30 / 30
» Constructing Big Trees from Short Sequences
Sort
View
89
Voted
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 2 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
ICDCSW
2008
IEEE
15 years 5 months ago
Scalable AOI-Cast for Peer-to-Peer Networked Virtual Environments
Networked virtual environments (NVEs) are computergenerated virtual worlds where users interact by exchanging messages via network connections. Each NVE user often pays attention ...
Jehn-Ruey Jiang, Yu-Li Huang, Shun-Yun Hu
101
Voted
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 3 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...