Alejandro A. Schäffer

According to our database1, Alejandro A. Schäffer authored at least 58 papers between 1985 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Characterizing The Landscape Of Viral Expression In Cancer By Deep Learning.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

2021
Ancestral haplotype reconstruction in endogamous populations using identity-by-descent.
PLoS Comput. Biol., 2021

Ribovore: ribosomal RNA sequence analysis for GenBank submissions and database curation.
BMC Bioinform., 2021

Tumor heterogeneity assessed by sequencing and fluorescence in situ hybridization (FISH) data.
Bioinform., 2021

2020
Tumor Copy Number Deconvolution Integrating Bulk and Single-Cell Sequencing Data.
J. Comput. Biol., 2020

VADR: validation and annotation of virus sequence submissions to GenBank.
BMC Bioinform., 2020

PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem.
Bioinform., 2020

2018
VecScreen_plus_taxonomy: imposing a tax(onomy) increase on vector contamination screening.
Bioinform., 2018

Tumor Copy Number Data Deconvolution Integrating Bulk and Single-cell Sequencing Data.
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

2017
Virus Variation Resource - improved response to emergent viral outbreaks.
Nucleic Acids Res., 2017

2016
Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study.
IEEE ACM Trans. Comput. Biol. Bioinform., 2016

2015
Inferring models of multiscale copy number evolution for single-tumor phylogenetics.
Bioinform., 2015

2014
Algorithms to Model Single Gene, Single Chromosome, and Whole Genome Copy Number Changes Jointly in Tumor Phylogenetics.
PLoS Comput. Biol., 2014

PSEUDOMARKER 2.0: efficient computation of likelihoods using NOMAD.
BMC Bioinform., 2014

2013
Phylogenetic analysis of multiprobe fluorescence <i>in situ</i> hybridization data from tumor cell populations.
Bioinform., 2013

2008
Database indexing for production MegaBLAST searches.
Bioinform., 2008

2007
Improved BLAST searches using longer words for protein seeding.
Bioinform., 2007

rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality control.
Bioinform., 2007

2006
A Fast and Symmetric DUST Implementation to Mask Low-Complexity DNA Sequences.
J. Comput. Biol., 2006

WindowMasker: window-based masker for sequenced genomes.
Bioinform., 2006

2005
A structure-based method for protein sequence alignment.
Bioinform., 2005

2000
Distance-Based Reconstruction of Tree Models for Oncogenesis.
J. Comput. Biol., 2000

Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations.
Discret. Appl. Math., 2000

1999
Inferring Tree Models for Oncogenesis from Comparative Genome Hybridization Data.
J. Comput. Biol., 1999

IMPALA: matching a protein sequence against a collection of PSI-BLAST-constructed position-specific score matrices.
Bioinform., 1999

1998
Approximation Algorithms for a Genetic Diagnostics Problem.
J. Comput. Biol., 1998

1996
Multiple Matching of Parametrized Patterns.
Theor. Comput. Sci., 1996

1995
Improved Dynamic Dictionary Matching
Inf. Comput., June, 1995

Multiple Matching of Rectangular Patterns
Inf. Comput., February, 1995

Improving the Practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment.
J. Comput. Biol., 1995

Optimal Edge Ranking of Trees in Polynomial Time.
Algorithmica, 1995

Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994
Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging.
Theor. Comput. Sci., 1994

Dynamic Dictionary Matching with Failure Functions.
Theor. Comput. Sci., 1994

Faster Isometric Embedding in Products of Complete Graphs.
Discret. Appl. Math., 1994

Multiple Matching of Parameterized Patterns.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993
Triangulating Three-Colored Graphs in Linear Time and Linear Space.
SIAM J. Discret. Math., 1993

A Faster Algorithm to Recognize Undirected Path Graphs.
Discret. Appl. Math., 1993

1992
Finding the prime factors of strong direct product graphs in polynomial time.
Discret. Math., 1992

Markov Analysis of Multiple-Disk Prefetching for External Mergesort.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

Dynamic Dictionary Matching with Failure Functions (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991
Simple Local Search Problems That are Hard to Solve.
SIAM J. Comput., 1991

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time.
J. Comput. Syst. Sci., 1991

Recognizing brittle graphs: remarks on a paper of Hoàng and Khouzam.
Discret. Appl. Math., 1991

1990
On the Complexity of Local Search (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
Fast Parallel Algorithms for Chordal Graphs.
SIAM J. Comput., 1989

Time bounds on fault-tolerant broadcasting.
Networks, 1989

Graph spanners.
J. Graph Theory, 1989

Optimal Node Ranking of Trees in Linear Time.
Inf. Process. Lett., 1989

1988
Algorithmic problems on intersection graphs.
PhD thesis, 1988

Recognizing Bellman-Ford-Orderable Graphs.
SIAM J. Discret. Math., 1988

A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm.
J. Algorithms, 1988

Storing and Searching a Multikey Table (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
Convex Hulls of Piecewise-Smooth Jordan Curves.
J. Algorithms, 1987

Shortest prefix strings containing all subset permutations.
Discret. Math., 1987

Fast Parallel Algorithms for Chordal Graphs (Extended Abstract)
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism.
SIAM J. Comput., 1986

1985
A polynomial time algorithm for finding the prime factors of cartesian-product graphs.
Discret. Appl. Math., 1985


  Loading...