Sciweavers

CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
13 years 8 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
13 years 8 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
CPM
2004
Springer
82views Combinatorics» more  CPM 2004»
13 years 8 months ago
Multi-seed Lossless Filtration (Extended Abstract)
Gregory Kucherov, Laurent Noé, Mikhail A. R...
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
13 years 9 months ago
Optimizing Multiple Spaced Seeds for Homology Search
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
CPM
2004
Springer
94views Combinatorics» more  CPM 2004»
13 years 9 months ago
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
13 years 9 months ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
13 years 9 months ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
13 years 9 months ago
On the k-Closest Substring and k-Consensus Pattern Problems
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
Yishan Jiao, Jingyi Xu, Ming Li
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
13 years 9 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
13 years 9 months ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...