PICS-Ord: unlimited coding of ambiguous regions by pairwise identity and cost scores ordination

Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Anal...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:BMC bioinformatics Ročník 12; číslo 1; s. 10
Hlavní autoři: Lücking, Robert, Hodkinson, Brendan P, Stamatakis, Alexandros, Cartwright, Reed A
Médium: Journal Article
Jazyk:angličtina
Vydáno: London BioMed Central 07.01.2011
BioMed Central Ltd
Springer Nature B.V
BMC
Témata:
ISSN:1471-2105, 1471-2105
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method. Results Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model. Conclusions Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED. Availability An implementation of the PICS-Ord algorithm is available from http://scit.us/projects/ngila/wiki/PICS-Ord . It requires both the statistical software, R http://www.r-project.org and the alignment software Ngila http://scit.us/projects/ngila .
AbstractList We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method.BACKGROUNDWe present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method.Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model.RESULTSIncluding ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model.Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED.CONCLUSIONSAdvantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED.An implementation of the PICS-Ord algorithm is available from http://scit.us/projects/ngila/wiki/PICS-Ord. It requires both the statistical software, R http://www.r-project.org and the alignment software Ngila http://scit.us/projects/ngila.AVAILABILITYAn implementation of the PICS-Ord algorithm is available from http://scit.us/projects/ngila/wiki/PICS-Ord. It requires both the statistical software, R http://www.r-project.org and the alignment software Ngila http://scit.us/projects/ngila.
We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method. Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model. Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED. An implementation of the PICS-Ord algorithm is available from http://scit.us/projects/ngila/wiki/PICS-Ord. It requires both the statistical software, R http://www.r-project.org and the alignment software Ngila http://scit.us/projects/ngila.
We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method. Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model. Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED. An implementation of the PICS-Ord algorithm is available from http://scit.us/projects/ngila/wiki/PICS-Ord. It requires both the statistical software, R http://www.r-project.org and the alignment software Ngila http://scit.us/projects/ngila.
We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method. Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model. Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED.
Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method. Results Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model. Conclusions Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED. Availability An implementation of the PICS-Ord algorithm is available from
Abstract Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method. Results Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model. Conclusions Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED. Availability An implementation of the PICS-Ord algorithm is available from http://scit.us/projects/ngila/wiki/PICS-Ord. It requires both the statistical software, R http://www.r-project.org and the alignment software Ngila http://scit.us/projects/ngila.
Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination' (PICS-Ord). The method works via ordination of sequence identity or cost scores matrices by means of Principal Coordinates Analysis (PCoA). After identification of ambiguous regions, the method computes pairwise distances as sequence identities or cost scores, ordinates the resulting distance matrix by means of PCoA, and encodes the principal coordinates as ordered integers. Three biological and 100 simulated datasets were used to assess the performance of the new method. Results Including ambiguous regions coded by means of PICS-Ord increased topological accuracy, resolution, and bootstrap support in real biological and simulated datasets compared to the alternative of excluding such regions from the analysis a priori. In terms of accuracy, PICS-Ord performs equal to or better than previously available methods of ambiguous region coding (e.g., INAASE), with the advantage of a practically unlimited alignment size and increased analytical speed and the possibility of PICS-Ord scores to be analyzed together with DNA data in a partitioned maximum likelihood model. Conclusions Advantages of PICS-Ord over step matrix-based ambiguous region coding with INAASE include a practically unlimited number of OTUs and seamless integration of PICS-Ord codes into phylogenetic datasets, as well as the increased speed of phylogenetic analysis. Contrary to word- and frequency-based methods, PICS-Ord maintains the advantage of pairwise sequence alignment to derive distances, and the method is flexible with respect to the calculation of distance scores. In addition to distance and maximum parsimony, PICS-Ord codes can be analyzed in a Bayesian or maximum likelihood framework. RAxML (version 7.2.6 or higher that was developed for this study) allows up to 32-state ordered or unordered characters. A GTR, MK, or ORDERED model can be applied to analyse the PICS-Ord codes partition, with GTR performing slightly better than MK and ORDERED. Availability An implementation of the PICS-Ord algorithm is available from http://scit.us/projects/ngila/wiki/PICS-Ord . It requires both the statistical software, R http://www.r-project.org and the alignment software Ngila http://scit.us/projects/ngila .
ArticleNumber 10
Audience Academic
Author Lücking, Robert
Cartwright, Reed A
Stamatakis, Alexandros
Hodkinson, Brendan P
AuthorAffiliation 4 Department of Biology and Biochemistry, University of Houston, 369 Science & Research Bldg 2, Houston, TX 77204-5001, USA
1 Department of Botany, The Field Museum, 1400 South Lake Shore Drive, Chicago, IL 60605-2496, USA
3 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118, Heidelberg, Germany
2 Department of Biology, Box 90338, Duke University, Durham, NC 27708-0338, USA
AuthorAffiliation_xml – name: 3 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118, Heidelberg, Germany
– name: 2 Department of Biology, Box 90338, Duke University, Durham, NC 27708-0338, USA
– name: 1 Department of Botany, The Field Museum, 1400 South Lake Shore Drive, Chicago, IL 60605-2496, USA
– name: 4 Department of Biology and Biochemistry, University of Houston, 369 Science & Research Bldg 2, Houston, TX 77204-5001, USA
Author_xml – sequence: 1
  givenname: Robert
  surname: Lücking
  fullname: Lücking, Robert
  email: rlucking@fieldmuseum.org
  organization: Department of Botany, The Field Museum
– sequence: 2
  givenname: Brendan P
  surname: Hodkinson
  fullname: Hodkinson, Brendan P
  organization: Department of Biology, Duke University
– sequence: 3
  givenname: Alexandros
  surname: Stamatakis
  fullname: Stamatakis, Alexandros
  organization: The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies
– sequence: 4
  givenname: Reed A
  surname: Cartwright
  fullname: Cartwright, Reed A
  organization: Department of Biology and Biochemistry, University of Houston
BackLink https://www.ncbi.nlm.nih.gov/pubmed/21214904$$D View this record in MEDLINE/PubMed
BookMark eNqFkktv1DAUhSNURB-wZociWCAWaX0d52EWSNWIx0iViiisLcd2gkeJPbUTYP49N50ydCoeyiLRzXeOr4_OcXLgvDNJ8hTIKUBdngGrIKNAigxoBuRBcrSbHNz5PkyOY1wRAlVNikfJIQUKjBN2lIiPy8VVdhn063RyvR3saHSqvLauS32byqGx3eSnmAbTWe9i2mzStbThu40mtdq40Y6bVLpZFMc0Kh9MTH1AAzmi4HHysJV9NE9u3yfJl3dvPy8-ZBeX75eL84tMlQUfMw5KGlXUFbR1pdvKlBy4zhta1YYXPOeUQ24YpcxQAyXLiW5IWzdlxRQ0rcpPkuXWV3u5EutgBxk2wksrbgY-dEKG0areCGOglbSivOQtGikJeat5QzQBxRtVotebrdd6agajFV4yyH7PdP-Ps19F57-JnFDGGaDBy1uD4K8nE0cx2KhM30tnMEvBC1bi8UD_S9aswgjqal7q-T1y5afgMFPBCSDC8tnuxRbqJF7Uutbjfmq2FOcUy8CxAgyp0z9Q-GgzWIUFay3O9wSv9gTIjObH2MkpRrG8-rTPPrsb3i61X5VD4GwLqOBjDKbdIUDEXGox11bMtRVAcYiK4p5C2fGmXbi37f-hI1tdxBNcZ8LvyP4m-QmlewXk
CitedBy_id crossref_primary_10_3732_ajb_1200146
crossref_primary_10_3852_12_338
crossref_primary_10_5598_imafungus_2018_09_01_09
crossref_primary_10_1016_j_ympev_2016_02_010
crossref_primary_10_1093_sysbio_syw065
crossref_primary_10_1007_s11557_023_01912_6
crossref_primary_10_2179_11_042
crossref_primary_10_1016_j_funbio_2015_07_003
crossref_primary_10_1093_sysbio_syy036
crossref_primary_10_1016_j_ympev_2013_04_005
crossref_primary_10_1017_S0024282916000232
crossref_primary_10_1639_007_2745_115_1_183
crossref_primary_10_1017_S0024282912000825
crossref_primary_10_1007_s11557_024_02011_w
crossref_primary_10_1017_S0024282913000212
Cites_doi 10.1016/j.mycres.2009.07.016
10.1080/10635150590947041
10.1111/j.1096-0031.1996.tb00189.x
10.1126/science.1158395
10.1093/bioinformatics/btm404
10.1007/978-0-387-45972-1
10.1080/10635150701281102
10.1007/BF00038690
10.1007/BF01731581
10.1371/journal.pbio.0020354
10.1186/1471-2105-6-83
10.1016/S0169-5347(01)02313-8
10.1080/10635150802429642
10.1186/1471-2105-7-527
10.1093/bioinformatics/btg180
10.1186/1471-2148-9-211
10.1093/bib/bbn013
10.1073/pnas.0409137102
10.1093/molbev/msi066
10.1093/molbev/msm060
10.1093/bioinformatics/bti1200
10.1016/0025-5564(81)90043-2
10.1080/10635150590946961
10.1109/TCBB.2006.4
10.1093/bioinformatics/btm619
10.1080/10635150802302476
10.1890/0012-9615(1999)069[0001:DBRATM]2.0.CO;2
10.1006/mpev.1995.1001
10.1093/nar/22.22.4673
10.1006/mpev.1993.1015
10.1080/10635150590950371
10.1093/bioinformatics/bti003
10.1080/10635150490264752
10.1016/S0959-440X(97)80055-3
10.1093/bioinformatics/btm095
10.1093/molbev/msn275
10.1016/j.mycres.2006.05.003
10.1080/10635150500541730
10.1016/j.ympev.2006.03.022
10.1080/106351500750049743
10.1093/nar/gkf436
10.1016/S0076-6879(88)64084-5
10.1186/1471-2105-8-1
10.1126/science.1171243
10.1080/10635150601156305
10.1093/nar/gkq443
10.1093/molbev/msp098
10.1371/journal.pbio.0020312
10.1093/bioinformatics/btl136
10.1080/10635150701472164
10.1093/bioinformatics/btg158
10.1006/mpev.2000.0785
10.1089/cmb.2006.13.1465
10.1093/bioinformatics/btl446
10.1111/j.1096-0031.2001.tb00100.x
10.1007/978-1-59745-251-9_3
10.2307/3761919
10.1096/fasebj.7.1.8422957
10.1093/sysbio/46.3.464
10.1093/molbev/msn103
10.1073/pnas.91.26.12832
ContentType Journal Article
Copyright Lücking et al; licensee BioMed Central Ltd. 2011
COPYRIGHT 2011 BioMed Central Ltd.
2011 Lücking et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright ©2011 Lücking et al; licensee BioMed Central Ltd. 2011 Lücking et al; licensee BioMed Central Ltd.
Copyright_xml – notice: Lücking et al; licensee BioMed Central Ltd. 2011
– notice: COPYRIGHT 2011 BioMed Central Ltd.
– notice: 2011 Lücking et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
– notice: Copyright ©2011 Lücking et al; licensee BioMed Central Ltd. 2011 Lücking et al; licensee BioMed Central Ltd.
DBID C6C
AAYXX
CITATION
CGR
CUY
CVF
ECM
EIF
NPM
ISR
3V.
7QO
7SC
7X7
7XB
88E
8AL
8AO
8FD
8FE
8FG
8FH
8FI
8FJ
8FK
ABUWG
AEUYN
AFKRA
ARAPS
AZQEC
BBNVY
BENPR
BGLVJ
BHPHI
CCPQU
DWQXO
FR3
FYUFA
GHDGH
GNUQQ
HCIFZ
JQ2
K7-
K9.
L7M
LK8
L~C
L~D
M0N
M0S
M1P
M7P
P5Z
P62
P64
PHGZM
PHGZT
PIMPY
PJZUB
PKEHL
PPXIY
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
7X8
5PM
DOA
DOI 10.1186/1471-2105-12-10
DatabaseName Springer Nature OA Free Journals
CrossRef
Medline
MEDLINE
MEDLINE (Ovid)
MEDLINE
MEDLINE
PubMed
Science in Context
ProQuest Central (Corporate)
Biotechnology Research Abstracts
Computer and Information Systems Abstracts
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
Medical Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest One Sustainability
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
Biological Science Collection
ProQuest Central
Technology Collection
Natural Science Collection
ProQuest One Community College
ProQuest Central Korea
Engineering Research Database
Proquest Health Research Premium Collection
Health Research Premium Collection (Alumni)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
ProQuest Health & Medical Complete (Alumni)
Advanced Technologies Database with Aerospace
ProQuest Biological Science Collection
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
ProQuest Health & Medical Collection
Medical Database
Biological Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Biotechnology and BioEngineering Abstracts
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
MEDLINE - Academic
PubMed Central (Full Participant titles)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
MEDLINE
Medline Complete
MEDLINE with Full Text
PubMed
MEDLINE (Ovid)
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ProQuest One Applied & Life Sciences
ProQuest One Sustainability
Health Research Premium Collection
Natural Science Collection
Health & Medical Research Collection
Biological Science Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
Advanced Technologies & Aerospace Collection
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
Biological Science Database
ProQuest Hospital Collection (Alumni)
Biotechnology and BioEngineering Abstracts
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
ProQuest Natural Science Collection
ProQuest Pharma Collection
ProQuest Central
ProQuest Health & Medical Research Collection
Biotechnology Research Abstracts
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
Advanced Technologies Database with Aerospace
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest Medical Library
ProQuest Central (Alumni)
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic
Engineering Research Database
MEDLINE




Publicly Available Content Database

Database_xml – sequence: 1
  dbid: DOA
  name: Openly Available Collection - DOAJ
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 3
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Biology
EISSN 1471-2105
EndPage 10
ExternalDocumentID oai_doaj_org_article_ee1fa272969f430ca13fd9b0d01c9bc6
PMC3024941
2501769811
A247190014
21214904
10_1186_1471_2105_12_10
Genre Research Support, U.S. Gov't, Non-P.H.S
Comparative Study
Research Support, Non-U.S. Gov't
Journal Article
Research Support, N.I.H., Extramural
GrantInformation_xml – fundername: NLM NIH HHS
  grantid: LM010009-01
GroupedDBID ---
0R~
23N
2VQ
2WC
4.4
53G
5VS
6J9
7X7
88E
8AO
8FE
8FG
8FH
8FI
8FJ
AAFWJ
AAJSJ
AAKPC
AASML
ABDBF
ABUWG
ACGFO
ACGFS
ACIHN
ACIWK
ACPRK
ACUHS
ADBBV
ADMLS
ADRAZ
ADUKV
AEAQA
AENEX
AEUYN
AFKRA
AFPKN
AFRAH
AHBYD
AHMBA
AHSBF
AHYZX
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMTXH
AOIJS
ARAPS
AZQEC
BAPOH
BAWUL
BBNVY
BCNDV
BENPR
BFQNJ
BGLVJ
BHPHI
BMC
BPHCQ
BVXVI
C1A
C6C
CCPQU
CS3
DIK
DU5
DWQXO
E3Z
EAD
EAP
EAS
EBD
EBLON
EBS
EJD
EMB
EMK
EMOBN
ESX
F5P
FYUFA
GNUQQ
GROUPED_DOAJ
GX1
H13
HCIFZ
HMCUK
HYE
IAO
ICD
IHR
INH
INR
IPNFZ
ISR
ITC
K6V
K7-
KQ8
LK8
M1P
M48
M7P
MK~
ML0
M~E
O5R
O5S
OK1
OVT
P2P
P62
PGMZT
PHGZM
PHGZT
PIMPY
PJZUB
PPXIY
PQGLB
PQQKQ
PROAC
PSQYO
PUEGO
RBZ
RIG
RNS
ROL
RPM
RSV
SBL
SOJ
SV3
TR2
TUS
UKHRP
W2D
WOQ
WOW
XH6
XSB
AAYXX
AFFHD
CITATION
ALIPV
CGR
CUY
CVF
ECM
EIF
NPM
3V.
7QO
7SC
7XB
8AL
8FD
8FK
FR3
JQ2
K9.
L7M
L~C
L~D
M0N
P64
PKEHL
PQEST
PQUKI
PRINS
Q9U
7X8
5PM
ID FETCH-LOGICAL-c659t-91caec5871f87df7e6919d3b278e959392913e4224e2e16430db0f8b674c1bfc3
IEDL.DBID P5Z
ISICitedReferencesCount 18
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000286458000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-2105
IngestDate Tue Oct 14 14:41:56 EDT 2025
Tue Nov 04 02:03:29 EST 2025
Mon Oct 06 18:05:16 EDT 2025
Fri Sep 05 08:33:14 EDT 2025
Mon Oct 06 18:23:23 EDT 2025
Tue Nov 11 10:26:49 EST 2025
Tue Nov 04 17:50:19 EST 2025
Thu Nov 13 15:17:56 EST 2025
Mon Jul 21 05:48:36 EDT 2025
Sat Nov 29 05:39:51 EST 2025
Tue Nov 18 20:31:45 EST 2025
Sat Sep 06 07:27:15 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Simulated Dataset
Internal Transcribe Spacer
Ambiguous Region
Phylogenetic Signal
Biological Dataset
Language English
License http://creativecommons.org/licenses/by/2.0
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c659t-91caec5871f87df7e6919d3b278e959392913e4224e2e16430db0f8b674c1bfc3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
OpenAccessLink https://www.proquest.com/docview/901887432?pq-origsite=%requestingapplication%
PMID 21214904
PQID 901887432
PQPubID 44065
ParticipantIDs doaj_primary_oai_doaj_org_article_ee1fa272969f430ca13fd9b0d01c9bc6
pubmedcentral_primary_oai_pubmedcentral_nih_gov_3024941
proquest_miscellaneous_954629612
proquest_miscellaneous_847278876
proquest_journals_901887432
gale_infotracmisc_A247190014
gale_infotracacademiconefile_A247190014
gale_incontextgauss_ISR_A247190014
pubmed_primary_21214904
crossref_primary_10_1186_1471_2105_12_10
crossref_citationtrail_10_1186_1471_2105_12_10
springer_journals_10_1186_1471_2105_12_10
PublicationCentury 2000
PublicationDate 2011-01-07
PublicationDateYYYYMMDD 2011-01-07
PublicationDate_xml – month: 01
  year: 2011
  text: 2011-01-07
  day: 07
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
– name: England
PublicationTitle BMC bioinformatics
PublicationTitleAbbrev BMC Bioinformatics
PublicationTitleAlternate BMC Bioinformatics
PublicationYear 2011
Publisher BioMed Central
BioMed Central Ltd
Springer Nature B.V
BMC
Publisher_xml – name: BioMed Central
– name: BioMed Central Ltd
– name: Springer Nature B.V
– name: BMC
References DT Jones (4327_CR1) 1997; 7
O Penn (4327_CR7) 2010
RA Cartwright (4327_CR49) 2007; 23
WP Maddison (4327_CR71) 2009
CW Cunningham (4327_CR50) 1997; 46
MJ Anderson (4327_CR68) 2003
C Moritz (4327_CR55) 2004; 2
B Staiger (4327_CR46) 2006; 110
A Loytynoja (4327_CR20) 2008; 320
A Mangold (4327_CR47) 2008; 57
AL Hipp (4327_CR51) 2004; 53
P Legendre (4327_CR69) 1999; 69
R Meier (4327_CR56) 2008
DL Aylor (4327_CR29) 2006; 22
J Gatesy (4327_CR60) 1993; 2
G Landan (4327_CR6) 2007; 24
G Didier (4327_CR35) 2006; 13
JD Thompson (4327_CR65) 1994; 22
K Katoh (4327_CR32) 2009; 537
B McCune (4327_CR43) 2006
P Legendre (4327_CR40) 1998
BD Redelings (4327_CR13) 2009
SA Berger (4327_CR74) 2009
MA Larkin (4327_CR48) 2007; 23
W Fletcher (4327_CR53) 2009; 26
TH Ogden (4327_CR5) 2006; 55
DL Swofford (4327_CR39) 2003
WC Wheeler (4327_CR3) 2001; 17
G Didier (4327_CR36) 2007; 8
A Stamatakis (4327_CR59) 2008; 57
K Katoh (4327_CR31) 2008; 9
F Ronquist (4327_CR58) 2003; 19
BD Redelings (4327_CR19) 2005; 54
G Lunter (4327_CR18) 2005; 6
R Fleissner (4327_CR17) 2005; 54
GJ Olsen (4327_CR8) 1988; 164
G Talavera (4327_CR10) 2007; 56
K Kjer (4327_CR24) 2007; 56
SA Smith (4327_CR76) 2008; 24
AF Zuur (4327_CR41) 2007
GJ Olsen (4327_CR9) 1993; 7
RA Cartwright (4327_CR52) 2005; 21
MSY Lee (4327_CR11) 2001; 16
D González (4327_CR27) 2006; 40
J Miadlikowska (4327_CR33) 2003; 95
B McCune (4327_CR42) 2002
R Development Core Team (4327_CR70) 2009
S Lehtonen (4327_CR23) 2008; 57
WC Wheeler (4327_CR14) 1996; 12
WC Wheeler (4327_CR26) 2009
RA Cartwright (4327_CR66) 2006; 7
JD Lawrey (4327_CR38) 2009; 113
A Loytynoja (4327_CR57) 2005; 102
BG Hall (4327_CR4) 2005; 22
DF Robinson (4327_CR72) 1981; 53
TH Ogden (4327_CR22) 2007; 56
WC Wheeler (4327_CR16) 2003
EW Price (4327_CR28) 2005; 21
RA Cartwright (4327_CR25) 2009; 26
RC Edgar (4327_CR15) 2003; 19
PD Hebert (4327_CR54) 2004; 2
A Phillips (4327_CR2) 2000; 16
M Kimura (4327_CR67) 1980; 16
O Penn (4327_CR64) 2010; 38
PR Minchin (4327_CR44) 1987; 69
F Lutzoni (4327_CR37) 2000; 49
B Dwivedi (4327_CR12) 2009; 9
DM Hillis (4327_CR45) 2005; 54
K Liu (4327_CR21) 2009; 324
A Stamatakis (4327_CR73) 2006; 22
S Karlin (4327_CR34) 1994; 91
G Landan (4327_CR62) 2008; 13
K Katoh (4327_CR30) 2002; 30
S Roch (4327_CR75) 2006; 3
BG Hall (4327_CR63) 2008; 25
WC Wheeler (4327_CR61) 1995; 4
17654362 - Syst Biol. 2007 Aug;56(4):564-77
12116431 - Syst Biol. 2000 Dec;49(4):628-51
12912839 - Bioinformatics. 2003 Aug 12;19(12):1572-4
15804354 - BMC Bioinformatics. 2005;6:83
17366144 - Syst Biol. 2007 Feb;56(1):133-46
16012107 - Syst Biol. 2005 Jun;54(3):401-18
17061922 - J Comput Biol. 2006 Oct;13(8):1465-76
16928733 - Bioinformatics. 2006 Nov 1;22(21):2688-90
17387111 - Bioinformatics. 2007 Jun 1;23(11):1427-8
15455034 - PLoS Biol. 2004 Oct;2(10):e312
15590907 - Mol Biol Evol. 2005 Mar;22(3):792-802
16306390 - Bioinformatics. 2005 Nov 1;21 Suppl 3:iii31-8
17387100 - Mol Biol Evol. 2007 Jun;24(6):1380-3
18853362 - Syst Biol. 2008 Oct;57(5):758-71
18566285 - Science. 2008 Jun 20;320(5883):1632-5
20497997 - Nucleic Acids Res. 2010 Jul;38(Web Server issue):W23-8
16012112 - Syst Biol. 2005 Jun;54(3):471-82
21149020 - Mycologia. 2003 Nov-Dec;95(6):1181-203
16085574 - Syst Biol. 2005 Aug;54(4):548-61
18709601 - Syst Biol. 2008 Aug;57(4):653-7
20207713 - Mol Biol Evol. 2010 Aug;27(8):1759-67
10991785 - Mol Phylogenet Evol. 2000 Sep;16(3):317-30
14965902 - Syst Biol. 2004 Feb;53(1):81-9
15486587 - PLoS Biol. 2004 Oct;2(10):e354
8025721 - Mol Phylogenet Evol. 1993 Jun;2(2):152-7
17199892 - BMC Bioinformatics. 2007;8:1
19698168 - BMC Evol Biol. 2009;9:211
16647865 - Mol Phylogenet Evol. 2006 Aug;40(2):459-70
12874053 - Bioinformatics. 2003 Jul 22;19(11):1404-11
18229673 - Pac Symp Biocomput. 2008;:15-24
17454974 - Syst Biol. 2007 Apr;56(2):182-93
11975330 - Syst Biol. 1997 Sep;46(3):464-78
18372315 - Brief Bioinform. 2008 Jul;9(4):286-98
12240677 - Cladistics. 2001 Mar;17(1 Pt 2):S3-11
19541996 - Science. 2009 Jun 19;324(5934):1561-4
7809130 - Proc Natl Acad Sci U S A. 1994 Dec 20;91(26):12832-6
19378139 - Methods Mol Biol. 2009;537:39-64
17048396 - IEEE/ACM Trans Comput Biol Bioinform. 2006 Jan-Mar;3(1):92-4
19042944 - Mol Biol Evol. 2009 Feb;26(2):473-80
8422957 - FASEB J. 1993 Jan;7(1):113-23
3241556 - Methods Enzymol. 1988;164:793-812
9204280 - Curr Opin Struct Biol. 1997 Jun;7(3):377-87
18458029 - Mol Biol Evol. 2008 Aug;25(8):1576-80
16876697 - Mycol Res. 2006 Jul;110(Pt 7):765-72
12136088 - Nucleic Acids Res. 2002 Jul 15;30(14):3059-66
7463489 - J Mol Evol. 1980 Dec;16(2):111-20
17147805 - BMC Bioinformatics. 2006;7:527
19423664 - Mol Biol Evol. 2009 Aug;26(8):1879-88
15353448 - Bioinformatics. 2005 Feb 1;21(3):402-4
7620631 - Mol Phylogenet Evol. 1995 Mar;4(1):1-9
16601003 - Bioinformatics. 2006 Jun 1;22(11):1399-401
18227120 - Bioinformatics. 2008 Mar 1;24(5):715-6
16000407 - Proc Natl Acad Sci U S A. 2005 Jul 26;102(30):10557-62
19646529 - Mycol Res. 2009 Oct;113(Pt 10):1154-71
16611602 - Syst Biol. 2006 Apr;55(2):314-28
7984417 - Nucleic Acids Res. 1994 Nov 11;22(22):4673-80
17846036 - Bioinformatics. 2007 Nov 1;23(21):2947-8
References_xml – volume: 113
  start-page: 1154
  year: 2009
  ident: 4327_CR38
  publication-title: Mycol Res
  doi: 10.1016/j.mycres.2009.07.016
– volume: 54
  start-page: 401
  year: 2005
  ident: 4327_CR19
  publication-title: Syst Biol
  doi: 10.1080/10635150590947041
– volume-title: Mol Biol Evol
  year: 2010
  ident: 4327_CR7
– volume: 12
  start-page: 1
  year: 1996
  ident: 4327_CR14
  publication-title: Cladistics
  doi: 10.1111/j.1096-0031.1996.tb00189.x
– volume: 320
  start-page: 1632
  year: 2008
  ident: 4327_CR20
  publication-title: Science
  doi: 10.1126/science.1158395
– volume: 23
  start-page: 2947
  year: 2007
  ident: 4327_CR48
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btm404
– volume-title: POY, version 3.0.11
  year: 2003
  ident: 4327_CR16
– start-page: 259
  volume-title: Analysing Ecological Data
  year: 2007
  ident: 4327_CR41
  doi: 10.1007/978-0-387-45972-1
– volume: 56
  start-page: 182
  year: 2007
  ident: 4327_CR22
  publication-title: Syst Biol
  doi: 10.1080/10635150701281102
– volume: 69
  start-page: 89
  year: 1987
  ident: 4327_CR44
  publication-title: Vegetatio
  doi: 10.1007/BF00038690
– volume: 16
  start-page: 111
  year: 1980
  ident: 4327_CR67
  publication-title: Mol Evol
  doi: 10.1007/BF01731581
– volume: 2
  start-page: 1529
  year: 2004
  ident: 4327_CR55
  publication-title: PLoS Biol
  doi: 10.1371/journal.pbio.0020354
– volume: 6
  start-page: 83
  year: 2005
  ident: 4327_CR18
  publication-title: BMC Bioinformat
  doi: 10.1186/1471-2105-6-83
– volume-title: PCO: a FORTRAN computer program for principal coordinate analysis
  year: 2003
  ident: 4327_CR68
– volume: 16
  start-page: 681
  year: 2001
  ident: 4327_CR11
  publication-title: Trends Ecol Evol
  doi: 10.1016/S0169-5347(01)02313-8
– volume-title: Numerical Ecology
  year: 1998
  ident: 4327_CR40
– volume: 57
  start-page: 758
  year: 2008
  ident: 4327_CR59
  publication-title: Syst Biol
  doi: 10.1080/10635150802429642
– volume: 13
  start-page: 15
  year: 2008
  ident: 4327_CR62
  publication-title: Pacific Symp Biocomput
– volume: 7
  start-page: 527
  year: 2006
  ident: 4327_CR66
  publication-title: BMC Bioinformatics
  doi: 10.1186/1471-2105-7-527
– volume-title: Proceedings of PBC09, Parallel Biocomputing Workshop, Wroclaw, Poland
  year: 2009
  ident: 4327_CR74
– volume: 57
  start-page: 476
  year: 2008
  ident: 4327_CR47
  publication-title: Taxon
– volume: 19
  start-page: 1572
  year: 2003
  ident: 4327_CR58
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btg180
– volume: 9
  start-page: 211
  year: 2009
  ident: 4327_CR12
  publication-title: BMC Evol Biol
  doi: 10.1186/1471-2148-9-211
– volume: 9
  start-page: 286
  year: 2008
  ident: 4327_CR31
  publication-title: Brief Bioinf
  doi: 10.1093/bib/bbn013
– volume-title: Sequence Alignment: Methods, Models, Concepts, and Strategies
  year: 2009
  ident: 4327_CR26
– volume: 102
  start-page: 10557
  year: 2005
  ident: 4327_CR57
  publication-title: Proc Natl Acad Sci
  doi: 10.1073/pnas.0409137102
– volume: 22
  start-page: 792
  year: 2005
  ident: 4327_CR4
  publication-title: Mol Biol Evol
  doi: 10.1093/molbev/msi066
– volume: 24
  start-page: 1380
  year: 2007
  ident: 4327_CR6
  publication-title: Mol Biol Evol
  doi: 10.1093/molbev/msm060
– volume: 21
  start-page: iii31
  issue: Suppl 3
  year: 2005
  ident: 4327_CR52
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/bti1200
– volume: 53
  start-page: 131
  year: 1981
  ident: 4327_CR72
  publication-title: Math Biosci
  doi: 10.1016/0025-5564(81)90043-2
– volume: 54
  start-page: 471
  year: 2005
  ident: 4327_CR45
  publication-title: Syst Biol
  doi: 10.1080/10635150590946961
– volume: 3
  start-page: 92
  year: 2006
  ident: 4327_CR75
  publication-title: IEEE Trans Comp Biol Bioinform
  doi: 10.1109/TCBB.2006.4
– volume: 24
  start-page: 715
  year: 2008
  ident: 4327_CR76
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btm619
– volume: 57
  start-page: 653
  year: 2008
  ident: 4327_CR23
  publication-title: Syst Biol
  doi: 10.1080/10635150802302476
– volume: 69
  start-page: 1
  year: 1999
  ident: 4327_CR69
  publication-title: Ecol Monogr
  doi: 10.1890/0012-9615(1999)069[0001:DBRATM]2.0.CO;2
– volume-title: R: A language and environment for statistical computing
  year: 2009
  ident: 4327_CR70
– volume-title: Analysis of Ecological Communities
  year: 2002
  ident: 4327_CR42
– volume: 4
  start-page: 1
  year: 1995
  ident: 4327_CR61
  publication-title: Mol Phyl Evol
  doi: 10.1006/mpev.1995.1001
– volume: 22
  start-page: 4673
  year: 1994
  ident: 4327_CR65
  publication-title: Nucl Acids Res
  doi: 10.1093/nar/22.22.4673
– volume: 2
  start-page: 152
  year: 1993
  ident: 4327_CR60
  publication-title: Mol Phyl Evol
  doi: 10.1006/mpev.1993.1015
– volume: 54
  start-page: 548
  year: 2005
  ident: 4327_CR17
  publication-title: Syst Biol
  doi: 10.1080/10635150590950371
– volume: 21
  start-page: 402
  year: 2005
  ident: 4327_CR28
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/bti003
– volume: 53
  start-page: 81
  year: 2004
  ident: 4327_CR51
  publication-title: Syst Biol
  doi: 10.1080/10635150490264752
– volume: 7
  start-page: 377
  year: 1997
  ident: 4327_CR1
  publication-title: Curr Opin Struct Biol
  doi: 10.1016/S0959-440X(97)80055-3
– volume: 23
  start-page: 1427
  year: 2007
  ident: 4327_CR49
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btm095
– volume: 26
  start-page: 473
  year: 2009
  ident: 4327_CR25
  publication-title: Mol Biol Evol
  doi: 10.1093/molbev/msn275
– volume: 110
  start-page: 765
  year: 2006
  ident: 4327_CR46
  publication-title: Mycol Res
  doi: 10.1016/j.mycres.2006.05.003
– volume: 55
  start-page: 314
  year: 2006
  ident: 4327_CR5
  publication-title: Syst Biol
  doi: 10.1080/10635150500541730
– volume: 40
  start-page: 459
  year: 2006
  ident: 4327_CR27
  publication-title: Mol Phyl Evol
  doi: 10.1016/j.ympev.2006.03.022
– volume: 49
  start-page: 628
  year: 2000
  ident: 4327_CR37
  publication-title: Syst Biol
  doi: 10.1080/106351500750049743
– volume: 30
  start-page: 3059
  year: 2002
  ident: 4327_CR30
  publication-title: Nucl Acids Res
  doi: 10.1093/nar/gkf436
– volume-title: The New Taxonomy
  year: 2008
  ident: 4327_CR56
– volume: 164
  start-page: 793
  year: 1988
  ident: 4327_CR8
  publication-title: Methods Enzymol
  doi: 10.1016/S0076-6879(88)64084-5
– volume: 8
  start-page: 1
  year: 2007
  ident: 4327_CR36
  publication-title: BMC Bioinformatics
  doi: 10.1186/1471-2105-8-1
– volume: 324
  start-page: 1561
  year: 2009
  ident: 4327_CR21
  publication-title: Science
  doi: 10.1126/science.1171243
– volume: 56
  start-page: 133
  year: 2007
  ident: 4327_CR24
  publication-title: Syst Biol
  doi: 10.1080/10635150601156305
– volume: 38
  start-page: W23
  year: 2010
  ident: 4327_CR64
  publication-title: Nucl Acids Res
  doi: 10.1093/nar/gkq443
– volume: 26
  start-page: 1879
  year: 2009
  ident: 4327_CR53
  publication-title: Mol Biol Evol
  doi: 10.1093/molbev/msp098
– volume: 2
  start-page: e312
  issue: 10
  year: 2004
  ident: 4327_CR54
  publication-title: PLoS Biol
  doi: 10.1371/journal.pbio.0020312
– volume-title: Mesquite: a modular system for evolutionary analysis. Version 2.7
  year: 2009
  ident: 4327_CR71
– volume: 22
  start-page: 1399
  year: 2006
  ident: 4327_CR29
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btl136
– volume: 56
  start-page: 564
  year: 2007
  ident: 4327_CR10
  publication-title: Syst Biol
  doi: 10.1080/10635150701472164
– volume: 19
  start-page: 1404
  year: 2003
  ident: 4327_CR15
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btg158
– start-page: 209
  volume-title: Sequence Alignment: Methods, Models, Concepts, and Strategies
  year: 2009
  ident: 4327_CR13
– volume: 16
  start-page: 317
  year: 2000
  ident: 4327_CR2
  publication-title: Mol Phyl Evol
  doi: 10.1006/mpev.2000.0785
– volume: 13
  start-page: 1465
  year: 2006
  ident: 4327_CR35
  publication-title: J Comput Biol
  doi: 10.1089/cmb.2006.13.1465
– volume: 22
  start-page: 2688
  year: 2006
  ident: 4327_CR73
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btl446
– volume-title: PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4 beta 10
  year: 2003
  ident: 4327_CR39
– volume: 17
  start-page: S3
  year: 2001
  ident: 4327_CR3
  publication-title: Cladistics
  doi: 10.1111/j.1096-0031.2001.tb00100.x
– volume: 537
  start-page: 39
  year: 2009
  ident: 4327_CR32
  publication-title: Meth Mol Biol
  doi: 10.1007/978-1-59745-251-9_3
– volume: 95
  start-page: 1181
  year: 2003
  ident: 4327_CR33
  publication-title: Mycologia
  doi: 10.2307/3761919
– volume: 7
  start-page: 113
  year: 1993
  ident: 4327_CR9
  publication-title: FASEB J
  doi: 10.1096/fasebj.7.1.8422957
– volume: 46
  start-page: 464
  year: 1997
  ident: 4327_CR50
  publication-title: Syst Biol
  doi: 10.1093/sysbio/46.3.464
– volume-title: Version 5. MjM Software, Gleneden Beach, Oregon, USA
  year: 2006
  ident: 4327_CR43
– volume: 25
  start-page: 1576
  year: 2008
  ident: 4327_CR63
  publication-title: Mol Biol Evol
  doi: 10.1093/molbev/msn103
– volume: 91
  start-page: 12832
  year: 1994
  ident: 4327_CR34
  publication-title: Proc Natl Acad Sci USA
  doi: 10.1073/pnas.91.26.12832
– reference: 16012112 - Syst Biol. 2005 Jun;54(3):471-82
– reference: 16306390 - Bioinformatics. 2005 Nov 1;21 Suppl 3:iii31-8
– reference: 19698168 - BMC Evol Biol. 2009;9:211
– reference: 19042944 - Mol Biol Evol. 2009 Feb;26(2):473-80
– reference: 15455034 - PLoS Biol. 2004 Oct;2(10):e312
– reference: 15590907 - Mol Biol Evol. 2005 Mar;22(3):792-802
– reference: 18458029 - Mol Biol Evol. 2008 Aug;25(8):1576-80
– reference: 19646529 - Mycol Res. 2009 Oct;113(Pt 10):1154-71
– reference: 17061922 - J Comput Biol. 2006 Oct;13(8):1465-76
– reference: 15486587 - PLoS Biol. 2004 Oct;2(10):e354
– reference: 16601003 - Bioinformatics. 2006 Jun 1;22(11):1399-401
– reference: 12240677 - Cladistics. 2001 Mar;17(1 Pt 2):S3-11
– reference: 17387111 - Bioinformatics. 2007 Jun 1;23(11):1427-8
– reference: 17199892 - BMC Bioinformatics. 2007;8:1
– reference: 16000407 - Proc Natl Acad Sci U S A. 2005 Jul 26;102(30):10557-62
– reference: 16876697 - Mycol Res. 2006 Jul;110(Pt 7):765-72
– reference: 16647865 - Mol Phylogenet Evol. 2006 Aug;40(2):459-70
– reference: 10991785 - Mol Phylogenet Evol. 2000 Sep;16(3):317-30
– reference: 16611602 - Syst Biol. 2006 Apr;55(2):314-28
– reference: 16012107 - Syst Biol. 2005 Jun;54(3):401-18
– reference: 7620631 - Mol Phylogenet Evol. 1995 Mar;4(1):1-9
– reference: 17454974 - Syst Biol. 2007 Apr;56(2):182-93
– reference: 19378139 - Methods Mol Biol. 2009;537:39-64
– reference: 15353448 - Bioinformatics. 2005 Feb 1;21(3):402-4
– reference: 8422957 - FASEB J. 1993 Jan;7(1):113-23
– reference: 16085574 - Syst Biol. 2005 Aug;54(4):548-61
– reference: 9204280 - Curr Opin Struct Biol. 1997 Jun;7(3):377-87
– reference: 17048396 - IEEE/ACM Trans Comput Biol Bioinform. 2006 Jan-Mar;3(1):92-4
– reference: 15804354 - BMC Bioinformatics. 2005;6:83
– reference: 7984417 - Nucleic Acids Res. 1994 Nov 11;22(22):4673-80
– reference: 19423664 - Mol Biol Evol. 2009 Aug;26(8):1879-88
– reference: 8025721 - Mol Phylogenet Evol. 1993 Jun;2(2):152-7
– reference: 18566285 - Science. 2008 Jun 20;320(5883):1632-5
– reference: 11975330 - Syst Biol. 1997 Sep;46(3):464-78
– reference: 20207713 - Mol Biol Evol. 2010 Aug;27(8):1759-67
– reference: 3241556 - Methods Enzymol. 1988;164:793-812
– reference: 20497997 - Nucleic Acids Res. 2010 Jul;38(Web Server issue):W23-8
– reference: 12116431 - Syst Biol. 2000 Dec;49(4):628-51
– reference: 18229673 - Pac Symp Biocomput. 2008;:15-24
– reference: 12874053 - Bioinformatics. 2003 Jul 22;19(11):1404-11
– reference: 12136088 - Nucleic Acids Res. 2002 Jul 15;30(14):3059-66
– reference: 14965902 - Syst Biol. 2004 Feb;53(1):81-9
– reference: 7809130 - Proc Natl Acad Sci U S A. 1994 Dec 20;91(26):12832-6
– reference: 17366144 - Syst Biol. 2007 Feb;56(1):133-46
– reference: 17654362 - Syst Biol. 2007 Aug;56(4):564-77
– reference: 12912839 - Bioinformatics. 2003 Aug 12;19(12):1572-4
– reference: 7463489 - J Mol Evol. 1980 Dec;16(2):111-20
– reference: 18709601 - Syst Biol. 2008 Aug;57(4):653-7
– reference: 18372315 - Brief Bioinform. 2008 Jul;9(4):286-98
– reference: 18227120 - Bioinformatics. 2008 Mar 1;24(5):715-6
– reference: 17387100 - Mol Biol Evol. 2007 Jun;24(6):1380-3
– reference: 18853362 - Syst Biol. 2008 Oct;57(5):758-71
– reference: 16928733 - Bioinformatics. 2006 Nov 1;22(21):2688-90
– reference: 17147805 - BMC Bioinformatics. 2006;7:527
– reference: 21149020 - Mycologia. 2003 Nov-Dec;95(6):1181-203
– reference: 17846036 - Bioinformatics. 2007 Nov 1;23(21):2947-8
– reference: 19541996 - Science. 2009 Jun 19;324(5934):1561-4
SSID ssj0017805
Score 2.0951903
Snippet Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores...
We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores Ordination'...
Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores...
Abstract Background: We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost...
Abstract Background We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by 'Pairwise Identity and Cost Scores...
SourceID doaj
pubmedcentral
proquest
gale
pubmed
crossref
springer
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 10
SubjectTerms Algorithms
Bioinformatics
Biomedical and Life Sciences
Cladistic analysis
Computational Biology - methods
Computational Biology/Bioinformatics
Computer Appl. in Life Sciences
Computer Simulation
DNA - genetics
DNA sequencing
Lichens - genetics
Life Sciences
Likelihood Functions
Methodology
Methodology Article
Methods
Microarrays
Nucleotide sequencing
Ordination
Performance assessment
Phylogeny
Principal Component Analysis
Sequence Alignment - methods
Sequence Analysis, DNA - methods
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELZQBRIXRHmGFmQhJOAQGsdeJ-ZWKioqoVJRQL1ZfraRSrba7FLtv2cmyYZN0YoLUk72OI-ZsT0Tz3xDyCvJjeVe-bRkBhyU6ARMKZelvuQCj9W4adH5f3wujo_LszN1slbqC2PCOnjgjnF7IbBocjABpYqCZ84wHr2ymc-YU9a1YNtZoVbOVH9-gEj9bV5RwVJwaiY9qA8r5d7QhkEJmDi7th-1sP1_L85ru9PNyMkbx6ftrnR4n9zrzUm6333GNrkV6gfkTldgcvmQ6JOjg9P0y8y_p4v6sstlom6K-xWdRmp-2up8Ab4_xfoMoH_ULumVqWbXVRNo1eXwLqmpcVAzpw1iXjYU_NWq-4n4iHw__Pjt4FPal1RInZyoOcrBBDcBLymWhY9FkIopz21elAEhisFYYjwI2NdDHsCT4pm3WSytLIRjNjr-mGzV0zo8JTQqk5kCzEMurJhEZ6T3MoJssBa98z4h71aM1a7HG8eyF5e69TtKqVESGiWhWQ6NCXkzDLjqoDY2k35ASQ1kiJHdNoDm6F5z9L80JyEvUc4aUTBqDLM5N4um0UenX_V-Ds9T6D4m5HVPFKfw9s70WQvAAwTOGlHujihhmrpR985KnXS_TDQajDFY5AXPE0KHXhyIkW91APlrsB5yjPiUm0nUREj4SgZ3edKp58AYMEzABc7g6cVIcUecG_fU1UWLMs4RTFKwhLxdqfif994glmf_Qyw75G733x6uYpdszWeL8Jzcdr_mVTN70U7z38n8Un4
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: Springer LINK
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELaqAhIX3o_QgiyEBBxC4zhxYm6loqISKlUXqt4sx48lUkmqZBe0_56ZJBtIYQ8g5RSPE2dm7JmJZz4T8kJwXXArbZgzDQGKNwlMKROFNucJbqtx3aHzn33Mjo_z83N5skXYuhamy3Zfb0l2K3U3rXOxx2AZDSFASTGZAIuqroGty1CRT2dn48YBQvQPCD5_6TQxPh1G_58r8W-m6Gqa5JW90s4EHd7-j8HfIbcGf5Pu9wpyl2y56h650Z9AubpP1MnRwSz81Ni3dFld9MVO1NRo0Gjtqf5WlPNlvWwpHuAACkqLFb3UZfOjbB0t-yLfFdUVdmoXtEVQzJZCQFv2fxkfkC-H7z8ffAiHMxdCI1K5QEFpZ1IIo3yeWZ85IZm0vIiz3CGGMXhTjLsEDL-LHYRaPLJF5PNCZIlhhTf8Idmu6so9JtRLHekM_EeeFEnqjRbWCu-txMPqjbUBebMWhjIDIDmei3GhusAkFwq5ppBrisVwMyCvxg6XPRbHZtJ3KN2RDEG0uxt1M1fDnFTOMa9jiC6E9PAhRjMOoysiGzEjCyMC8hx1QyFMRoV5OHO9bFt1NDtV-zG8T2J8GZCXA5GvYfRGD2UNwANE1ppQ7k4oYR6bSfPOWgXVsI60Crw1sAIJjwNCx1bsiKlxlQP5K3AvYkwJFZtJZJoI-EoGT3nUq_TIGPBcIEaO4O3ZRNknnJu2VOXXDoacI9pkwgLyeq3yv8a9QSxP_oF2h9zs_9_Dle2S7UWzdE_JdfN9UbbNs27W_wQ4xlFT
  priority: 102
  providerName: Springer Nature
Title PICS-Ord: unlimited coding of ambiguous regions by pairwise identity and cost scores ordination
URI https://link.springer.com/article/10.1186/1471-2105-12-10
https://www.ncbi.nlm.nih.gov/pubmed/21214904
https://www.proquest.com/docview/901887432
https://www.proquest.com/docview/847278876
https://www.proquest.com/docview/954629612
https://pubmed.ncbi.nlm.nih.gov/PMC3024941
https://doaj.org/article/ee1fa272969f430ca13fd9b0d01c9bc6
Volume 12
WOSCitedRecordID wos000286458000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVADU
  databaseName: BioMed Central
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: RBZ
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.biomedcentral.com/search/
  providerName: BioMedCentral
– providerCode: PRVAON
  databaseName: Openly Available Collection - DOAJ
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: DOA
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: M~E
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: P5Z
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Biological Science Database (ProQuest)
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: M7P
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/biologicalscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: K7-
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Health & Medical Collection
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: 7X7
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthcomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: BENPR
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: PIMPY
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer LINK
  customDbUrl:
  eissn: 1471-2105
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017805
  issn: 1471-2105
  databaseCode: RSV
  dateStart: 20001201
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwELfYBhIvfH-EjcpCSMBDWBLnkxe0TZuYgBK1MHW8WI4_SqSRlKYF9b_nLknDMlRekKpIjS-J7Tuf7-zz7wh5HjKRMZUoO3YFOChG-jCkpGOrmPm4rcZEjc5_9iEaDuPJJEnb2JyqDatc68RaUatS4hr5PsxbMB585r2d_bAxaRRurrYZNLbIDoIkYOaGNPjabSIgXH-L5uPG4b4LetgGDyfAaAQ8MXtpIqrx-v_Wypempashk1f2Tevp6OT2fzbkDrnV2qH0oBGcu-SaLu6RG01mytV9wtPTo7H9aa7e0GVx0RyCorLEiY6WhorvWT5dlsuKYmIHEFyarehM5PNfeaVp3hz-XVFR4EPVglYIlllRcHTzZvXxAflycvz56J3d5mKwZRgkC2Sg0DIA98rEkTKRDhM3USzzolgjtjFYWS7TPhgE2tPggjFHZY6JszDypZsZyR6S7aIs9GNCTSIcEYFdyfzMD4wUoVKhMSrBJPZSKYu8XjOGyxaoHPNlXPDaYYlDjpzkyEnuenDTIi-7B2YNRsdm0kPkdEeG4Nr1jXI-5e1Y5Vq7RnjgdYSJgYZI4TKoXeYox5VJJkOLPEM54QifUWB8zlQsq4qfjkf8wIPvJeh3WuRFS2RKqL0U7XEH6ANE3OpR7vUoYXzLXvHuWo54q18q3gmRRWhXig9iyFyhgf8czA4PQ0XDzSRJ4IfQShfe8qgR765jwKIB39mBr0c9we_1XL-kyL_V8OQMUSh91yKv1kPkT703sOXJP9u4S242K_nwi_bI9mK-1E_JdflzkVfzAdmKJlF9jQdk5_B4mI4G9coKXN9H9gCjedNBrRmgPD39mJ7Dv9H47DcDfmZl
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Zb9QwELZKAcEL9xFawEIg4CE0zh0khEqh6qpLqdqC9s04PpZIJVk2u1T7o_iPzOSiKVre-oCUp3ic-JjDY4-_IeRp6InUU4myYybAQTHSB5GSjq1iz8djNU9U6PxfhtHeXjwaJfsr5Fd7FwbDKludWClqVUjcI98AuwXy4Hvu28kPG5NG4eFqm0Gj5opdvTgBj618M3gP0_vMdbc_HG3t2E1SAVuGQTLDlggtA_ATTBwpE-kwYYnyUjeKNYL0wnKBedoHy6ZdDb6E56jUMXEaRr5kqZEefPcCuQhqPEKBikadf8cwPUCDHsTicIOB3rfBowow-gFv6J4yfFV-gL-twCkzeDZE88w5bWX-tq__ZwN3g1xr1tl0sxaMm2RF57fI5Trz5uI24fuDrUP701S9pvP8uL7kRWWBhpwWhorvaTaeF_OSYuIKEEyaLuhEZNOTrNQ0qy83L6jIsVI5oyWCgZYUepfVu6t3yOdz6d1dspoXub5PqEmEIyJYN3t-6gdGilCp0BiVgHcWSKUs8qplBC4bIHbMB3LMK4csDjlyDkfO4cyFlxZ50VWY1Bgky0nfIWd1ZAgeXr0opmPe6CKuNTPCBa8qTAx0RArmQetSRzlMJqkMLfIE-ZIjPEiO8UdjMS9LPjg84Jsu_C9Bv9oizxsiU0DrpWiuc8AYIKJYj3K9Rwn6S_aK11q-5Y3-LHnHtBahXSlWxJDAXMP8c1hWuRgKGy4nSQI_hF4y-Mq9Wpy6gYEVG_MTB_4e9QStN3L9kjz7VsGve4iy6TOLvGxF8k-7l0zLg3_28TG5snP0cciHg73dNXK1PrWAJ1onq7PpXD8kl-TPWVZOH1X6hpKv5y2nvwFYJ7k6
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwELfQ-BAvfH-EDbAQEvAQFsepE_M2BhMVU6lWmPZmOf4okUZSNS2o_z13SVrIoA8IqU_xubHvzvZdfPc7Qp4LrnNupQ0zpsFB8SaBJWWi0GY8wWs1rht0_tPjdDTKzs7kuIvNqdfR7usryTanAVGaysX-zPp2iWdin8GWGoKzMsDAAkywupywKEPo_JPJ6eYSAeH6OzSfv3TqHUQNXv-fu_Jvx9LFkMkL96bNcXR08z8ncovc6OxQetAqzm1yyZV3yNW2MuXqLlHj4eEk_DS3b-iyPG-ToKip8KCjlaf6W15Ml9WypljYARSX5is608X8R1E7WrTJvyuqS-xUL2iNYJk1BUe3aL8-3iNfjt5_PvwQdrUYQiMGcoEC1M4MwL3yWWp96oRk0vI8TjOH2MZgZTHuEjAIXOzABeORzSOf5SJNDMu94ffJTlmV7iGhXupIp2BX8iRPBt5oYa3w3kosYm-sDcjrtWCU6YDKsV7GuWoclkwo5JpCrikWw8OAvNx0mLUYHdtJ36KkN2QIrt08qOZT1a1V5RzzOgavQ0gPEzGacRhdHtmIGZkbEZBnqCcK4TNKjM-Z6mVdq-HkRB3E8D6JfmdAXnREvoLRG92lOwAPEHGrR7nXo4T1bXrNu2t1VN3-Uiuw4uB0SHgcELppxY4YMlc6kL8CsyPGUFGxnUQOEgGzZPAvD1r13jAGLBrwnSN4e9pT_B7n-i1l8bWBJ-eIQpmwgLxaq_-vcW8Ry6N_oH1Kro3fHanj4ejjLrnefuKHX7pHdhbzpXtMrpjvi6KeP2k2g5874l0S
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=PICS-Ord%3A+unlimited+coding+of+ambiguous+regions+by+pairwise+identity+and+cost+scores+ordination&rft.jtitle=BMC+bioinformatics&rft.au=L%C3%BCcking%2C+Robert&rft.au=Hodkinson%2C+Brendan+P&rft.au=Stamatakis%2C+Alexandros&rft.au=Cartwright%2C+Reed+A&rft.date=2011-01-07&rft.issn=1471-2105&rft.eissn=1471-2105&rft.volume=12&rft.spage=10&rft_id=info:doi/10.1186%2F1471-2105-12-10&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon