Sciweavers

3604 search results - page 37 / 721
» All Common Subsequences
Sort
View
BMCBI
2008
142views more  BMCBI 2008»
13 years 8 months ago
Identification of biomarkers for genotyping Aspergilli using non-linear methods for clustering and classification
Background: In the present investigation, we have used an exhaustive metabolite profiling approach to search for biomarkers in recombinant Aspergillus nidulans (mutants that produ...
Irene Kouskoumvekaki, Zhiyong Yang, Svava Ó...
SP
2006
IEEE
177views Security Privacy» more  SP 2006»
14 years 2 months ago
FIREMAN: A Toolkit for FIREwall Modeling and ANalysis
Security concerns are becoming increasingly critical in networked systems. Firewalls provide important defense for network security. However, misconfigurations in firewalls are ...
Lihua Yuan, Jianning Mai, Zhendong Su, Hao Chen, C...
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
14 years 10 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
14 years 3 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman