Sciweavers

BMCBI
2006
95views more  BMCBI 2006»
13 years 4 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
BMCBI
2006
141views more  BMCBI 2006»
13 years 4 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
BMCBI
2006
100views more  BMCBI 2006»
13 years 4 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
BMCBI
2006
104views more  BMCBI 2006»
13 years 4 months ago
SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools
Background: Deluged by the rate and complexity of completed genomic sequences, the need to align longer sequences becomes more urgent, and many more tools have thus been developed...
Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Ch...
BMCBI
2006
102views more  BMCBI 2006»
13 years 4 months ago
UVPAR: fast detection of functional shifts in duplicate genes
Background: The imprint of natural selection on gene sequences is often difficult to detect. A plethora of methods have been devised to detect genetic changes due to selective pro...
Vicente Arnau, Miguel Gallach, J. Ignasi Lucas, Ig...
ENDM
2008
82views more  ENDM 2008»
13 years 4 months ago
Repetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
Said Sadique Adi, Marília D. V. Braga, Cris...
ALMOB
2006
89views more  ALMOB 2006»
13 years 4 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
ALMOB
2006
138views more  ALMOB 2006»
13 years 4 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
DM
2008
58views more  DM 2008»
13 years 4 months ago
A two-parameter family of an extension of Beatty sequences
Beatty sequences n + are nearly linear, also called balanced, namely, the absolute value of the difference D of the number of el
Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T...
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 4 months ago
On Unconditionally Secure Computation with Vanishing Communication Cost
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
Ye Wang, Shantanu Rane, Wei Sun, Prakash Ishwar