Sciweavers

146 search results - page 3 / 30
» Efficient algorithms for the block edit problems
Sort
View
130
Voted
PVLDB
2010
195views more  PVLDB 2010»
14 years 4 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
JCB
2006
115views more  JCB 2006»
14 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
84
Voted
ICALP
2001
Springer
15 years 2 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
PDPTA
2000
14 years 11 months ago
Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems
In this paper, a parallel evolutionary multi-criteria optimization algorithm: DGA and DRMOGA are applied to block layout problems. The results are compared to the results of SGA an...
Shinya Watanabe, Tomoyuki Hiroyasu, Mitsunori Miki
IPL
2008
95views more  IPL 2008»
14 years 9 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...