Giribet et al., 2002 - Google Patents

DNA multiple sequence alignments

Giribet et al., 2002

Document ID
8041515935158323915
Author
Giribet G
Wheeler W
Muona J
Publication year
Publication venue
Molecular systematics and evolution: theory and practice

External Links

Snippet

In this chapter we examine the procedure of multiple sequence alignment. We first examine the heuristic procedures commonly used in multiple sequence alignment. Next we examine sources of ambiguity involved in the alignment procedure. We suggest that several …
Continue reading at link.springer.com (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30964Querying
    • G06F17/30979Query processing
    • G06F17/30985Query processing by using string matching techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/22Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for sequence comparison involving nucleotides or amino acids, e.g. homology search, motif or SNP [Single-Nucleotide Polymorphism] discovery or sequence alignment
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computer systems based on biological models
    • G06N3/12Computer systems based on biological models using genetic models
    • G06N3/126Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/14Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for phylogeny or evolution, e.g. evolutionarily conserved regions determination or phylogenetic tree construction
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7219Countermeasures against side channel or fault attacks

Similar Documents

Publication Publication Date Title
Storm et al. Automated ortholog inference from phylogenetic trees and calculation of orthology reliability
Cheetham et al. Solving large FPT problems on coarse-grained parallel machines
Giribet et al. DNA multiple sequence alignments
Huelsenbeck et al. Statistical tests of host‐parasite cospeciation
Caprara et al. 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap
Wiens et al. Phylogenetic analysis and intraspecific variation: performance of parsimony, likelihood, and distance methods
Matsuda Protein phylogenetic inference using maximum likelihood with a genetic algorithm
Lukashin et al. Neural network models for promoter recognition
Cherry A practical exact maximum compatibility algorithm for reconstruction of recent evolutionary history
Löytynoja Phylogeny-aware alignment with PRANK and PAGAN
Nguyen et al. A parallel hybrid genetic algorithm for multiple protein sequence alignment
Yu et al. An efficient exact algorithm for the motif stem search problem over large alphabets
Adam et al. Common intervals and symmetric difference in a model-free phylogenomics, with an application to streptophyte evolution
Penny et al. Turbo Tree: a fast algorithm for minimal trees
Hawks How much can cladistics tell us about early hominid relationships?
Giribet et al. ‘Pluralism’and the aims of phylogenetic research
Salisbury Misinformative characters and phylogeny shape
Agrawal et al. A faster subquadratic algorithm for the longest common increasing subsequence problem
Psomopoulos et al. A finite state automata based technique for protein classification rules induction
Baker et al. Genetic algorithm for optimizing global alignment of protein-protein interaction network
KR100537636B1 (en) Apparatus for predicting transcription factor binding sites based on similar sequences and method thereof
Gupta et al. MSA-GA: multiple sequence alignment tool based on genetic approach
Ma et al. Graphchainer: Colinear chaining for accurate alignment of long reads to variation graphs
Ruth Numerical Encoding of Symbolic Data: Standard, State of the Art, and New Techniques
Autere An Empirical Study of Population and Non-population Based Search Strategies for Optimizing a Combinatorical Problem