Sciweavers

2736 search results - page 315 / 548
» Bioinformatics
Sort
View
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
15 years 10 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
GCA
2007
15 years 8 months ago
Grid Computing in an Academic Environment
This paper describes an investigation into the provision of grid computing facilities in a typical university environment. In particular, it focuses on the use of the Java programm...
George Wells, Gregory Atkinson
BIOCOMP
2006
15 years 8 months ago
Parameterized Computation of LCS for Two Sequences
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
Yuan Lin, Jeff Jenness, Xiuzhen Huang
WOA
2003
15 years 8 months ago
A Programming Environment for Global Activity-based Applications
Abstract— This paper focuses on large-scale distributed systems that can be modeled as workflows of activities sharing resources, knowledge, know-how and services. We propose a ...
Flavio Corradini, Leonardo Mariani, Emanuela Merel...
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
15 years 7 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
Minghui Jiang