Sciweavers

7 search results - page 1 / 2
» Efficient Sequence Alignment with Side-Constraints by Cluste...
Sort
View
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 4 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
13 years 9 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
BMCBI
2005
109views more  BMCBI 2005»
13 years 4 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
ICCV
2009
IEEE
14 years 9 months ago
Recognizing Actions by Shape-Motion Prototype Trees
A prototype-based approach is introduced for action recognition. The approach represents an action as a se- quence of prototypes for efficient and flexible action match- ing in ...
Zhe Lin, Zhuolin Jiang, Larry S. Davis
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 ...