Ribovore: Ribosomal Rna Sequence Analysis For Genbank Submissions And Database Curation | 0 | 0.34 | 2021 |
Ancestral Haplotype Reconstruction In Endogamous Populations Using Identity-By-Descent | 1 | 0.34 | 2021 |
Tumor heterogeneity assessed by sequencing and fluorescence in situ hybridization (FISH) data | 0 | 0.34 | 2021 |
VADR: validation and annotation of virus sequence submissions to GenBank. | 0 | 0.34 | 2020 |
PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem. | 0 | 0.34 | 2020 |
Tumor Copy Number Deconvolution Integrating Bulk and Single-Cell Sequencing Data. | 1 | 0.37 | 2020 |
VecScreen_plus_taxonomy: Imposing a Tax(onomy) Increase on Vector Contamination Screening. | 0 | 0.34 | 2018 |
Tumor Copy Number Data Deconvolution Integrating Bulk and Single-cell Sequencing Data | 1 | 0.37 | 2018 |
Virus Variation Resource - Improved Response To Emergent Viral Outbreaks | 6 | 0.57 | 2017 |
Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study. | 0 | 0.34 | 2016 |
Inferring models of multiscale copy number evolution for single-tumor phylogenetics | 4 | 0.45 | 2015 |
Algorithms to Model Single Gene, Single Chromosome, and Whole Genome Copy Number Changes Jointly in Tumor Phylogenetics. | 16 | 0.94 | 2014 |
PSEUDOMARKER 2.0: efficient computation of likelihoods using NOMAD. | 0 | 0.34 | 2014 |
Phylogenetic analysis of multiprobe fluorescence in situ hybridization data from tumor cell populations. | 17 | 1.82 | 2013 |
Database indexing for production MegaBLAST searches. | 29 | 8.94 | 2008 |
rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality control. | 1 | 0.39 | 2007 |
Improved BLAST searches using longer words for protein seeding | 5 | 1.19 | 2007 |
A fast and symmetric DUST implementation to mask low-complexity DNA sequences. | 29 | 5.48 | 2006 |
WindowMasker: window-based masker for sequenced genomes. | 24 | 5.64 | 2006 |
A structure-based method for protein sequence alignment | 5 | 0.73 | 2005 |
Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations | 0 | 0.34 | 2000 |
Distance-based reconstruction of tree models for oncogenesis. | 24 | 2.98 | 2000 |
Inferring tree models for oncogenesis from comparative genome hybridization data. | 51 | 6.87 | 1999 |
IMPALA: matching a protein sequence against a collection of PSI-BLAST-constructed position-specific score matrices. | 76 | 12.39 | 1999 |
Approximation Algorithms for a Genetic Diagnostics Problem | 0 | 0.34 | 1997 |
Multiple matching of parameterized patterns | 27 | 1.73 | 1996 |
Improved dynamic dictionary matching | 45 | 2.65 | 1995 |
Multiple matching of rectangular patterns | 13 | 0.93 | 1995 |
Markov analysis of multiple-disk prefetching strategies for external merging | 19 | 1.29 | 1994 |
Faster isometric embedding in products of complete graphs | 6 | 0.94 | 1994 |
Dynamic dictionary matching with failure functions | 12 | 1.29 | 1994 |
A faster algorithm to recognize undirected path graphs | 12 | 0.83 | 1993 |
Optimal Edge Ranking of Trees in Polynomial Time. | 37 | 1.89 | 1993 |
Triangulating three-colored graphs in linear time and linear space | 9 | 1.37 | 1993 |
Dynamic Dictionary Matching with Failure Functions (Extended Abstract) | 6 | 1.12 | 1992 |
Markov Analysis Of Multiple-Disk Prefetching For External Mergesort | 0 | 0.34 | 1992 |
Finding the prime factors of strong direct product graphs in polynomial time | 22 | 2.53 | 1992 |
An implicit data structure for searching a multikey table in logarithmic time | 7 | 0.92 | 1991 |
Simple local search problems that are hard to solve | 89 | 11.52 | 1991 |
Recognizing Brittle Graphs - Remarks On A Paper Of Hoang And Khouzam | 7 | 0.61 | 1991 |
On the Complexity of Local Search (Extended Abstract) | 2 | 0.39 | 1990 |
Fast parallel algorithms for chordal graphs | 44 | 3.05 | 1989 |
Graph spanners | 89 | 20.49 | 1989 |
Time-Bounds On Fault-Tolerant Broadcasting | 18 | 1.52 | 1989 |
Recognizing Bellman-Ford-orderable graphs | 2 | 0.38 | 1988 |
Storing and Searching a Multikey Table (Extended Abstract) | 3 | 3.15 | 1988 |
A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm | 0 | 0.34 | 1988 |
Convex hulls of piecewise-smooth Jordan curves | 24 | 6.70 | 1987 |
Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) | 8 | 0.78 | 1987 |
Recognizing composite graphs is equivalent to testing graph isomorphism | 4 | 1.81 | 1986 |