Computational geometry: an introduction
Computational geometry: an introduction
Sparse dynamic programming I: linear cost functions
Journal of the ACM (JACM)
Picking alignments from (steiner) trees
Proceedings of the sixth annual international conference on Computational biology
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Fast algorithms for computing tree LCS
Theoretical Computer Science
Multiple genome alignment: chaining algorithms revisited
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A chaining algorithm for mapping cDNA sequences to multiple genomic sequences
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
EuroMPI'10 Proceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface
Novel definition and algorithm for chaining fragments with proportional overlaps
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A high-throughput approach for associating microRNAs with their activity conditions
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
| Hi-index | 0.00 |