Sciweavers

151 search results - page 7 / 31
» Longest Common Pattern between two Permutations
Sort
View
CSB
2003
IEEE
15 years 2 months ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
ICPR
2010
IEEE
15 years 21 days ago
Normalized Sum-Over-Paths Edit Distances
Abstract--In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are v...
Silvia García, François Fouss, Masashi Shimbo, M...
CLEF
2006
Springer
15 years 1 months ago
Paraphrase Substitution for Recognizing Textual Entailment
We describe a method for recognizing textual entailment that uses the length of the longest common subsequence (LCS) between two texts as its decision criterion. Rather than requi...
Wauter Bosma, Chris Callison-Burch
83
Voted
FUIN
2006
79views more  FUIN 2006»
14 years 9 months ago
Simple Gene Assembly Is Deterministic
We investigate in this paper a simple intramolecular model for gene assembly in ciliates. Unlike the general intramolecular model, the folds that a micronuclear chromosome may for...
Miika Langille, Ion Petre
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
15 years 4 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw