Sciweavers

Share
JDA
2008
122views more  JDA 2008»
9 years 1 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
JDA
2008
84views more  JDA 2008»
9 years 1 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
JDA
2008
72views more  JDA 2008»
9 years 1 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
JDA
2008
78views more  JDA 2008»
9 years 1 months ago
Fast equation automaton computation
Ahmed Khorsi, Faissal Ouardi, Djelloul Ziadi
JDA
2008
66views more  JDA 2008»
9 years 1 months ago
A note on two source location problems
Guy Kortsarz, Zeev Nutov
JDA
2008
87views more  JDA 2008»
9 years 1 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
JDA
2008
62views more  JDA 2008»
9 years 1 months ago
A parallel extended GCD algorithm
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (...
Sidi Mohamed Sedjelmaci
JDA
2008
89views more  JDA 2008»
9 years 1 months ago
Counting the number of independent sets in chordal graphs
Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
JDA
2008
60views more  JDA 2008»
9 years 1 months ago
A 3-approximation algorithm for the subtree distance between phylogenies
Magnus Bordewich, Catherine McCartin, Charles Semp...
JDA
2008
94views more  JDA 2008»
9 years 1 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
books