Name
Papers
Collaborators
ALEJANDRO A. SCHÄFFER
51
128
Citations 
PageRank 
Referers 
827
136.66
1640
Referees 
References 
665
365
Search Limit
1001000
Title
Citations
PageRank
Year
Ribovore: Ribosomal Rna Sequence Analysis For Genbank Submissions And Database Curation00.342021
Ancestral Haplotype Reconstruction In Endogamous Populations Using Identity-By-Descent10.342021
Tumor heterogeneity assessed by sequencing and fluorescence in situ hybridization (FISH) data00.342021
VADR: validation and annotation of virus sequence submissions to GenBank.00.342020
PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem.00.342020
Tumor Copy Number Deconvolution Integrating Bulk and Single-Cell Sequencing Data.10.372020
VecScreen_plus_taxonomy: Imposing a Tax(onomy) Increase on Vector Contamination Screening.00.342018
Tumor Copy Number Data Deconvolution Integrating Bulk and Single-cell Sequencing Data10.372018
Virus Variation Resource - Improved Response To Emergent Viral Outbreaks60.572017
Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study.00.342016
Inferring models of multiscale copy number evolution for single-tumor phylogenetics40.452015
Algorithms to Model Single Gene, Single Chromosome, and Whole Genome Copy Number Changes Jointly in Tumor Phylogenetics.160.942014
PSEUDOMARKER 2.0: efficient computation of likelihoods using NOMAD.00.342014
Phylogenetic analysis of multiprobe fluorescence in situ hybridization data from tumor cell populations.171.822013
Database indexing for production MegaBLAST searches.298.942008
rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality control.10.392007
Improved BLAST searches using longer words for protein seeding51.192007
A fast and symmetric DUST implementation to mask low-complexity DNA sequences.295.482006
WindowMasker: window-based masker for sequenced genomes.245.642006
A structure-based method for protein sequence alignment50.732005
Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations00.342000
Distance-based reconstruction of tree models for oncogenesis.242.982000
Inferring tree models for oncogenesis from comparative genome hybridization data.516.871999
IMPALA: matching a protein sequence against a collection of PSI-BLAST-constructed position-specific score matrices.7612.391999
Approximation Algorithms for a Genetic Diagnostics Problem00.341997
Multiple matching of parameterized patterns271.731996
Improved dynamic dictionary matching452.651995
Multiple matching of rectangular patterns130.931995
Markov analysis of multiple-disk prefetching strategies for external merging191.291994
Faster isometric embedding in products of complete graphs60.941994
Dynamic dictionary matching with failure functions121.291994
A faster algorithm to recognize undirected path graphs120.831993
Optimal Edge Ranking of Trees in Polynomial Time.371.891993
Triangulating three-colored graphs in linear time and linear space91.371993
Dynamic Dictionary Matching with Failure Functions (Extended Abstract)61.121992
Markov Analysis Of Multiple-Disk Prefetching For External Mergesort00.341992
Finding the prime factors of strong direct product graphs in polynomial time222.531992
An implicit data structure for searching a multikey table in logarithmic time70.921991
Simple local search problems that are hard to solve8911.521991
Recognizing Brittle Graphs - Remarks On A Paper Of Hoang And Khouzam70.611991
On the Complexity of Local Search (Extended Abstract)20.391990
Fast parallel algorithms for chordal graphs443.051989
Graph spanners8920.491989
Time-Bounds On Fault-Tolerant Broadcasting181.521989
Recognizing Bellman-Ford-orderable graphs20.381988
Storing and Searching a Multikey Table (Extended Abstract)33.151988
A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm00.341988
Convex hulls of piecewise-smooth Jordan curves246.701987
Fast Parallel Algorithms for Chordal Graphs (Extended Abstract)80.781987
Recognizing composite graphs is equivalent to testing graph isomorphism41.811986
  • 1
  • 2