Sciweavers

4860 search results - page 187 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
13 years 10 months ago
DNPTrapper: an assembly editing tool for finishing and analysis of complex repeat regions
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...
Erik Arner, Martti T. Tammi, Anh-Nhi Tran, Ellen K...
BIRTHDAY
2003
Springer
14 years 3 months ago
On the Pagination of Complex Documents
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
Anne Brüggemann-Klein, Rolf Klein, Stefan Woh...
MKWI
2008
190views Business» more  MKWI 2008»
13 years 11 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
COMPGEOM
2010
ACM
14 years 3 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
PR
2008
129views more  PR 2008»
13 years 10 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park