The SCEAS System
Navigation Menu

Conferences in DBLP

Algorithms in Bioinformatics (wabi)
2010 (conf/wabi/2010)


  1. A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea. [Citation Graph (, )][DBLP]


  2. Sparse Estimation for Structural Variability. [Citation Graph (, )][DBLP]


  3. Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors. [Citation Graph (, )][DBLP]


  4. Sparsification of RNA Structure Prediction Including Pseudoknots. [Citation Graph (, )][DBLP]


  5. Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs. [Citation Graph (, )][DBLP]


  6. Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. [Citation Graph (, )][DBLP]


  7. Reconstruction of Ancestral Genome Subject to Whole Genome Duplication, Speciation, Rearrangement and Loss. [Citation Graph (, )][DBLP]


  8. Genomic Distance with DCJ and Indels. [Citation Graph (, )][DBLP]


  9. Listing All Sorting Reversals in Quadratic Time. [Citation Graph (, )][DBLP]


  10. Discovering Kinship through Small Subsets. [Citation Graph (, )][DBLP]


  11. Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites. [Citation Graph (, )][DBLP]


  12. Haplotypes versus Genotypes on Pedigrees. [Citation Graph (, )][DBLP]


  13. Haplotype Inference on Pedigrees with Recombinations and Mutations. [Citation Graph (, )][DBLP]


  14. Identifying Rare Cell Populations in Comparative Flow Cytometry. [Citation Graph (, )][DBLP]


  15. Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA. [Citation Graph (, )][DBLP]


  16. Design of an Efficient Out-of-Core Read Alignment Algorithm. [Citation Graph (, )][DBLP]


  17. Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data. [Citation Graph (, )][DBLP]


  18. Improved Orientations of Physical Networks. [Citation Graph (, )][DBLP]


  19. Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. [Citation Graph (, )][DBLP]


  20. Efficient Subgraph Frequency Estimation with G-Tries. [Citation Graph (, )][DBLP]


  21. Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. [Citation Graph (, )][DBLP]


  22. The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. [Citation Graph (, )][DBLP]


  23. Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data. [Citation Graph (, )][DBLP]


  24. An Experimental Study of Quartets MaxCut and Other Supertree Methods. [Citation Graph (, )][DBLP]


  25. An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation. [Citation Graph (, )][DBLP]


  26. Effective Algorithms for Fusion Gene Detection. [Citation Graph (, )][DBLP]


  27. Swiftly Computing Center Strings. [Citation Graph (, )][DBLP]


  28. Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size. [Citation Graph (, )][DBLP]


  29. Pair HMM Based Gap Statistics for Re-evaluation of Indels in Alignments with Affine Gap Penalties. [Citation Graph (, )][DBLP]


  30. Quantifying the Strength of Natural Selection of a Motif Sequence. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002