Searching journal content for articles similar to Paten et al. 21 (9): 1512.

Displaying results 1-10 of 36
For checked items
  1. ...: chirag@iisc.ac.inAbstractAffordable genotyping methods are essential in genomics. Commonly used genotyping methods primarily support single-nucleotide variants and short indels but neglect structural variants. Additionally, accuracy of read alignments to a reference is unreliable in highly polymorphic...
  2. ...in Minichain (v1.3). Our experiments show that the algorithm produces alignment with fewer false recombinations and better selection of the correct haplotypes.More work is needed, especially to establish that the proposed haplotype-aware mapping algorithms can lead to improvements in routine genomic...
  3. ...of the top-performing methods will depend upon the feasibility of whole- alignment, availability of RNA-seq data, importance of capturing noncoding parts of the transcriptome, and, when whole- alignment is not feasible, the relative performance in BUSCO recovery between BRAKER3 and StringTie. When whole...
  4. ...) and the Human Pan Reference Consortium (HPRC) (Ebert et al. 2021; Liao et al. 2023). Efforts such as these have generated data with different sequence technologies and applied different algorithms and strategies to generate multiple phased human s, including some that now rival the contiguity and accuracy...
  5. ...of individual Hydra promoter regions (Supplemental Fig. S7; Vogg et al. 2019), supporting the accuracy of our -wide approach. We then used our whole- alignment to classify genomic features as either conserved or nonconserved (for details, see Supplemental Material). We provide lists of conserved noncoding...
  6. ...), which was used to realignMULTIZ based alignments in this competition but can in principle refine alignments from any multiple alignment tool. We also tested pairwise WGAs from the GenomeMatch team. As might be expected, not all algorithms/ pipelines were run for all test sets. Participants cited...
  7. .... First, we present a new algorithm for synteny block reconstruction for multiple mammalian s. Our approach combines Cactus, a multiple whole- aligner (Paten et al. 2011), with a new iterative graph simplification algorithm that produces hierarchical synteny blocks on multiple scales. Second, we show how...
  8. ...graphs—has proven to be a challenge, and the tools in Table 2 have approached these problems in various ways. Local alignment Although extending fully ordered dynamic programming algorithms to partially ordered directed acyclic graphs is relatively simple (Lee et al. 2002), sequence graphs...
    OPEN ACCESS ARTICLE
  9. ...a Cactus graph (Paten et al. 2011a,b; Nguyen et al. 2015; Armstrong et al. 2019), which is a reference-free whole- alignment. Usage of a Cactus graph enhances detection of synteny and facilitates extraction of alignments for specific regions in multiple s. The Cactus graph used in this study includes 29...
  10. ..., 2008; Hoff et al. 2016, 2019). A second set of predictions was produced by generating a whole- multiple sequence alignment of all duckweed species with Cactus (Paten et al. 2011) and running AUGUSTUS in CGP mode (König et al. 2016). The final set of predictions was produced by running AUGUSTUS within...
For checked items

Preprint Server