4302 search results - page 315 / 861 » Index Pairs Algorithms |
134
Voted
BMCBI
2010
15 years 4 months ago
2010
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
143
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
128
click to vote
FCCM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
157
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
153
Voted
BMCBI
2008
15 years 4 months ago
2008
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...