Sciweavers

Share
204 search results - page 1 / 41
» Fast Algorithms for Computing Tree LCS
Sort
View
CPM
2008
Springer
129views Combinatorics» more  CPM 2008»
8 years 5 months ago
Fast Algorithms for Computing Tree LCS
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-U...
BIOCOMP
2009
8 years 4 months ago
Fast Algorithms for Computing the Constrained LCS of Run-Length Encoded Strings
Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, ...
IEEESCC
2009
IEEE
8 years 29 days ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
WSCG
2003
143views more  WSCG 2003»
8 years 4 months ago
Fast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
books