Sciweavers

JCB
2006
91views more  JCB 2006»
13 years 9 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just
JCB
2006
115views more  JCB 2006»
13 years 9 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
JPDC
2008
129views more  JPDC 2008»
13 years 9 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
DATAMINE
2007
93views more  DATAMINE 2007»
13 years 9 months ago
Evaluation of ordinal attributes at value level
We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes’ and class’ values and prov...
Marko Robnik-Sikonja, Koen Vanhoof
JPDC
2008
135views more  JPDC 2008»
13 years 9 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward
DAM
2007
177views more  DAM 2007»
13 years 9 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
DAM
2007
105views more  DAM 2007»
13 years 9 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
JBCB
2006
60views more  JBCB 2006»
13 years 9 months ago
Efficient Algorithms and Software for Detection of Full-length Ltr Retrotransposons
LTR retrotransposons constitute one of the most abundant classes of repetitive elements in eukaryotic genomes. In this paper, we present a new algorithm for detection of full-leng...
Anantharaman Kalyanaraman, Srinivas Aluru
JAT
2006
64views more  JAT 2006»
13 years 9 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger
JNW
2008
149views more  JNW 2008»
13 years 9 months ago
Improving Semantic Web Service Discovery
Semantic Web Services (SWS) propose to extend the traditional Web Services technologies on the way to consolidate ontologies and semantics. This makes it possible to select, integr...
J. Javier Samper, F. Javier Adell, Leo van den Ber...