Sciweavers

15 search results - page 3 / 3
» The fragment assembly string graph
Sort
View
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
13 years 12 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
NIPS
2004
13 years 8 months ago
Contextual Models for Object Detection Using Boosted Random Fields
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
Antonio Torralba, Kevin P. Murphy, William T. Free...
IANDC
2007
111views more  IANDC 2007»
13 years 7 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
BIOCOMP
2008
13 years 8 months ago
GIPSCo: A Method for Comparison of Protein Structures Based on Geometric Invariants
Protein structure comparison is important for elucidation of evolutionary relationships, function and functionally important amino acid residues. We propose Geometric Invariant bas...
Sandeep Deshmukh, Aniket Dalal, Pramod Wangikar