Result 1 to 20 of 107 total
Graph orientations optimizing the number of light or heavy vertices. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 332-343 (2012).
1
Faster computation of the Robinson-Foulds distance between phylogenetic networks. (English)
Inf. Sci. 197, 77-90 (2012).
2
Computing the rooted triplet distance between galled trees by counting triangles. (English)
Kärkkäinen, Juha (ed.) et al., Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31264-9/pbk). Lecture Notes in Computer Science 7354, 385-398 (2012).
3
io-port 06064610 Czyzowicz, Jurek;
Dobrev, Stefan;
G\c{a}sieniec, Leszek;
Ilcinkas, David;
Jansson, Jesper;
Klasing, Ralf;
Lignos, Ioannis;
Martin, Russell;
Sadakane, Kunihiko;
Sung, Wing-Kin
More efficient periodic traversal in anonymous undirected graphs. (English)
Theor. Comput. Sci. 444, 60-76 (2012).
4
Asymptotic limits of a new type of maximization recurrence with an application to bioinformatics. (English)
Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 177-188 (2012).
5
Fast relative Lempel-Ziv self-index for similar sequences. (English)
Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14‒16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 291-302 (2012).
6
Inferring a graph from path frequency. (English)
Discrete Appl. Math. 160, No. 10-11, 1416-1428 (2012).
7
The complexity of inferring a minimally resolved phylogenetic supertree. (English)
SIAM J. Comput. 41, No. 1, 272-291 (2012).
8
Ultra-succinct representation of ordered trees with applications. (English)
J. Comput. Syst. Sci. 78, No. 2, 619-631 (2012).
9
Framework for massively parallel adaptive finite element computational fluid dynamics on tetrahedral meshes. (English)
SIAM J. Sci. Comput. 34, No. 1, C24-C41 (2012).
10
Approximation algorithms for buy-at-bulk geometric network design. (English)
Int. J. Found. Comput. Sci. 22, No. 8, 1949-1969 (2011).
11
Algorithms for building consensus MUL-trees. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 744-753 (2011).
12
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. (English)
J. Comb. Optim. 22, No. 1, 78-96 (2011).
13
Algorithms for finding a most similar subforest. (English)
Theory Comput. Syst. 48, No. 4, 865-887 (2011).
14
Flexible taxonomic assignment of ambiguous sequencing reads. (English)
BMC Bioinform. 12, 8 (2011).
15
Graph orientation to maximize the minimum weighted outdegree. (English)
Int. J. Found. Comput. Sci. 22, No. 3, 583-601 (2011).
16
Computing a smallest multilabeled phylogenetic tree from rooted triplets (English)
IEEE/ACM Trans. Comput. Biology Bioinform. 8, No. 4, 1141-1147 (2011).
17
Algorithms for building consensus MUL-trees (English)
ISAAC, 744-753 (2011).
18
New results on optimizing rooted triplets consistency. (English)
Discrete Appl. Math. 158, No. 11, 1136-1147 (2010).
19
The complexity of inferring a minimally resolved phylogenetic supertree. (English)
Moulton, Vincent (ed.) et al., Algorithms in bioinformatics. 10th international workshop, WABI 2010, Liverpool, UK, September 6‒8, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15293-1/pbk). Lecture Notes in Computer Science 6293. Lecture Notes in Bioinformatics, 262-273 (2010).
20
Result 1 to 20 of 107 total
Start
Contact
Print
General Help
