Sciweavers

Share
5 search results - page 1 / 1
» Designing an A* Algorithm for Calculating Edit Distance betw...
Sort
View
JCB
2006
115views more  JCB 2006»
9 years 1 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
ECML
2006
Springer
9 years 5 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
BIBE
2006
IEEE
132views Bioinformatics» more  BIBE 2006»
9 years 7 months ago
Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments
Ribonucleic acid (RNA) molecules contain the genetic information that regulates the functions of organisms. Given two different molecules, a preserved function corresponds to a pr...
Rimon Mikhaiel, Guohui Lin, Eleni Stroulia
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
9 years 7 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
BPM
2006
Springer
166views Business» more  BPM 2006»
9 years 5 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
books