Sciweavers

179 search results - page 9 / 36
» An Optimal Decomposition Algorithm for Tree Edit Distance
Sort
View
110
Voted
TIP
2008
131views more  TIP 2008»
14 years 9 months ago
Hyperspectral Image Compression: Adapting SPIHT and EZW to Anisotropic 3-D Wavelet Coding
Abstract--Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability...
Emmanuel Christophe, Corinne Mailhes, Pierre Duham...
75
Voted
ALMOB
2008
131views more  ALMOB 2008»
14 years 9 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
15 years 11 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
EVOW
2007
Springer
15 years 3 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
15 years 3 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...