Sciweavers

2834 search results - page 437 / 567
» Representing Trees with Constraints
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 4 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
COMPGEOM
2006
ACM
15 years 4 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
103
Voted
ALMOB
2008
85views more  ALMOB 2008»
15 years 27 days ago
Noisy: Identification of problematic columns in multiple sequence alignments
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...
BMCBI
2008
200views more  BMCBI 2008»
15 years 26 days ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
114
Voted
BMCBI
2008
134views more  BMCBI 2008»
15 years 26 days ago
Bioinformatic analyses of mammalian 5'-UTR sequence properties of mRNAs predicts alternative translation initiation sites
Background: Utilization of alternative initiation sites for protein translation directed by non-AUG codons in mammalian mRNAs is observed with increasing frequency. Alternative in...
Jill L. Wegrzyn, Thomas M. Drudge, Faramarz Valafa...