Brain [DGY05]. Breast [BHMA06].

A Complete Bibliography of IEEE/ACM Transactions
on Computational Biology and Bioinformatics
Nelson H.F.Beebe
University of Utah
Department of Mathematics,110LCB
155S1400E RM233
Salt Lake City,UT84112-0090
USA
Tel:+18015815254
FAX:+18015814148
E-mail:beebe@math.utah.edu,,
(Internet)
WWW URL:www.math.utah.edu/~beebe/
30November2006
Version1.10
Title word cross-reference
1.375[EH06].O(N2)[BHS+04].
-Approximation[EH06].
1[LNY05b].
2[LNY05a].
Accuracy[MNW+04].across[EW04]. Agreement[BN06].Algorithm[SS04]. Algorithms[MO04].Alignment[CWC04]. Alignments[HVG04].Analog[Pre04]. Analog-Spectrum[Pre04].
Analysis[MO04].Analyzing[SCSS05]. Ancestral[SLH06b].Annual[Ano04a].
Applicability[HB05].
Application[LFS06].Approach[HVG04]. Approaches[Ano05b].
Approximation[EH06].
Assignment[CZF+05].
Associate[Wil04a].Associative[KNS+05]. Attribute[ACWW05].Automatic[RV06]. Backbone[HSTW06].Based[ST05]. Bases[PCGS05].Bayesian[CGPW06]. between[KNS+05].Biclustering[MO04]. Biclusters[YNBM05].Binary[YNBM05]. Biochemical[VSR+06].
Biogeography[GGJ+06].
Bioinformatics[Gus04b].
Biological[MO04].Biomedical[LNC+05]. Biopolymer[SLH+06a].BLAST[CWC04]. Boolean[BHS+04].Bounds[BB04].
1
2
Brain[DGY05].Breast[BHMA06]. Builder[VSR+06].
Call[Ano05b].Cancer[ST05].
Cards[PCGS05].cDNA[RGCB05].
Cells[SDA+06].Census[DSZ+06]. Chromosomes[BWS05].
Classification[YLXJ04].Climbing[R V06]. Clustering[ACWW05].
Coherent[YNBM05].
Combining[KMG+05].
Comparative[LNC+05].
Comparing[SS06a].Comparison[AS05]. Comparisons[BAK06].
Compatibility[SS06b].
Compatible[BN06].Complex[PG06]. Complexity[CEFBS06].
Component[BSLR05].Concise[Son06]. Condition[Son06].
Configurations[SLH06b].Conflict[BB04]. Consensus[WHS04].
Conserved[BMM06].Consistency[SR06]. Consistent[PG06].
Constitutive[SDA+06].
Constrained[GHL05].
Constructing[DH04].Contact[Gra04]. Contact-Map[Gra04].Copy[BHMA06]. Correlation[SSP+05].Counting[SLH06b]. Courses[SCSS05].Creating[VSR+06]. Crossing[Gra04].Cut[SR06].
Data[MO04].Decision[YNBM05]. Decomposition[RGCB05].
Degree[SS06a].Dependencies[KNS+05]. Detecting[RH05].Detection[Wer06]. Diagrams[YNBM05].
Differentially[AAP06].
Dimension[ST05].
Dimensional[CHC+05].
Discovering[BHS+04].
Discovery[RLV04].
Discriminant[YLXJ04].Distance[AS05]. Divergence[EW04].DNA[RL V04]. Downhill[SS04].Duplication[BG05].Duplications[SS06a].
Editor[Ano04b].Editorial[KJ04]. Editorial-State[Gus05].Editors[Wil04a]. Effective[AAP06].Efficient[CFOS06].
Efficiently[TK05].Encoding[RH05]. Enhance[SR06].Enumeration[SS06b]. Epithelial[SDA+06].Essential[Mam05]. Estimating[SS04].Events[BB04]. Example[DSZ+06].Excisions[SS06a]. Existence[Son06].Exocytosis[SDA+06]. Exploring[KNS+05].Expressed[AAP06]. Expression[YLXJ04].
False[SS04].Faster[BAK06].
FastR[ZHEB05].Filtration[KNR05]. Finding[AAP06].Flip[CEFBS06].
Fold[Xu05].Formulas[ZGC+05]. Fragment[ZGC+05].
Framework[CHC+05].
Functional[KNS+05].Fuzzy[PKM06]. Galled[Son06].Galled-Tree[Son06]. Gapped[CWC04].Gene[YLXJ04].
Gene-to-Gene[LNC+05].
Generalized[BSLR05].
Generating[PCGS05].Genes[CZF+05]. Genetic[KN05].Genetics[SLH06b]. Genome[CZF+05].Genomes[ZHEB05]. Genomic[RH05].Genomics[KNS+05]. GO[SSP+05].Graph[BB04].
Graphs[DH04].Gridding[RV06]. Grouping[ACWW05].
Guest[KJ04,LNY05b].
Haplotype[BH06].Haplotyping[SHI06]. Hard[Roc06].Hidden[Gou06].
High[AS05].Hill[RV06].
Hill-Climbing[RV06].History[BB04]. Homology[Bro05].Human[BWS05]. Hybrid[KN05].Hybridization[Pre04]. Identification[CFOS06].IEEE[Gus04b]. IEEE/ACM[Gus04b].II[KJ05].
3
Image[NU06].Images[RV06].
Improved[CWC04].Including[WHS04]. Index[Ano04a].Inference[GHL05]. Information[DGH+06].Instances[Lab06]. Integer[BH06].Intelligence[Ano05b]. Interactions[Mam05].
Interface[VSR+06].Intervals[BMM06]. Introduction[Gus04b].Ions[ZGC+05]. Islands[SHI06].Isotope[ZGC+05].
Issue[LNY05b].
JigCell[VSR+06].Joint[BWS05].
Jointly[BHMA06].Journal[Gus06b]. Knowledge[Mam05].
Large[GHL05].Large-Scale[GHL05]. Lasso[GHL05].Latent[Mam05].
Learn[KMG+05].Learning[LNY05b]. Level[AS05].Likelihood[Roc06].
List[IEE05].Literature[LNC+05].
Local[SS04].Logistic[ST05].
Lossless[KNR05].Lower[BB04].
Machine[LNY05b].Map[Gra04]. Mapping[DGH+06].Marker[DGH+06]. Markov[RH05].Mass[ZGC+05]. Matching[Gra04].Max[SR06].
Maximum[Csu04].
Maximum-Scoring[Csu04].
Measures[PKM06].Message[Wil04b]. Metabolic[LFS06].Method[RL V04]. Microarray[RGCB05].
Minimum[CEFBS06].
Minimum-Flip[CEFBS06].
Mining[LNC+05].Model[Gou06]. Modeling[MNW+04].Models[EW04]. Modules[KMG+05].Molecular[FSMJ05]. Morphogenesis[CHC+05].Motif[RL V04]. Motifs[PCGS05].Multiple[HVG04]. Multiseed[KNR05].Mutants[DSZ+06]. Mutation[DSZ+06].Mutual[DGH+06]. Necessary[Son06].Network[GHL05].Network-Lasso-Constrained[GHL05]. Networks[MNW+04].Neural[KN05]. Neural-Genetic[KN05].
Noncoding[ZHEB05].Novel[TK05]. Number[BB04].
Ontology[PKM06].Optimal[BHS+04]. Optimizing[Bro05].pm2.5治理
Orthologous[CZF+05].
p53[DSZ+06].Pairing[BWS05].
Pairs[BHS+04].Pairwise[BAK06]. Papers[Ano05b].Parameterized[BN06]. Parameterless[TK05].
Parsimony[BH06].Part[KJ04].
Partial[HDKS04].Pattern[BHS+04]. Patterns[Gra04].Peak[YLL+06]. Pedigrees[PG06].Penalized[ST05].
ACM[Gus04b].Phylogenetic[MNW+04]. Polynomial[Gra04].
Polynomial-Time[Gra04].
Population[SLH06b].Possible[SLH06b]. Powerful[AAP06].Predicted[Xu05]. Predicting[ZGC+05].
Prediction[WHS04].Preserve[BMM06]. Problems[BN06].Process[RGCB05]. Product[PKM06].Profile[HVG04].
Profiles[CGPW06].Profiling[FSMJ05]. Programming[BH06].
Progressive[HVG04].Projection[RLV04]. Promoter[CFOS06].Proof[Roc06]. Properties[DGY05].Proposal[Pre04]. Protein[Bro05].
Protein-Protein[Mam05].
Pseudoknots[WHS04].Pure[HVG04]. Ranking[ZLZ06].Rate[SS04].
Rates[EW04].Rates-across-Sites[EW04]. Reaction[VSR+06].
Rearrangement[CZF+05]. Rearrangements[BG05].
Recognition[Xu05].
Recombination[BB04]. Reconstructibility[MNW+04].
REFERENCES4
Reconstruction[Roc06].
Recurrent[HB05].Reduction[ST05]. Reduction-Based[ST05].
Regression[ST05].Regulation[Gou06]. Regulatory[GHL05].
Relationships[LNC+05].
Repeated[PCGS05].Repeats[SS06a]. Rescue[DSZ+06].Reversals[BMM06]. Reviewers[IEE05].Revisited[Pre04]. RNA[HVG04].Rooted[SR06].
Sample[BB04].Samples[ZLZ06].
Scale[GHL05].
Scale-Space-Based[YLL+06].
Scoring[Csu04].Search[SS04]. Searching[ZHEB05].Secondary[HVG04]. Section[KJ04].Seeds[Bro05].
Segment[Csu04].Segmental[CGPW06]. Selection[ACWW05].Semantic[SSP+05]. Semisupervised[FSMJ05].
Sequence[KMG+05].Sequences[RL V04]. Sequencing[Pre04].
Sequencing-by-Hybridization[Pre04]. Sequential[YLL+06].Series[KMG+05]. Sets[Csu04].Shannon[DGH+06].
Shape[DZA+06].
Shape-Structure[DZA+06].
Short[Roc06].Signals[RH05].
Significance[ZLZ06].
Significantly[AAP06].
Similarity[SSP+05].
Simulation[CHC+05].Single[Gou06]. Sites[EW04].Sorting[EH06].
Space[YLL+06].Spaces[DSZ+06].
Spatio[SDA+06].
Spatio-Temporal[SDA+06].
Special[KJ04,LNY05b].
Spectra[ZGC+05].Spectrum[Pre04]. Splits[DH04].Spreadsheet[VSR+06]. State[Gus05].Statistical[HSTW06]. Statistics[NU06].Stochastic[SS04]. Structure[HVG04].
Structure-Sequence[SLH+06a]. Structured[TBKH05].Structures[WHS04].Study[LNC+05]. Subtree[BN06].Sufficient[Son06].
Super[HDKS04].
Super-Networks[HDKS04].
Supertrees[CEFBS06].
Suppressed[YNBM05].Survey[MO04]. Tandem[BG05].Temporal[SDA+06]. Text[LNC+05].Three[CHC+05].
Three-Dimensional[CHC+05].
Time[Gra04].Time-Courses[SCSS05]. Times[EW04].Tissue[YLXJ04]. Topological[BG05].Tractability[SHI06]. Tractable[Lab06].Transaction[Gus05]. Transcriptional[KMG+05].
Transmission[PG06].
Transposition[Lab06].
Transpositions[EH06].Tree[Roc06]. TreeDT[STO06].Trees[HDKS04]. Tumors[DGY05].
Uncorrelated[YLXJ04].
Unicyclic[SS06b].Unidentifiable[EW04]. Uniform[RL V04].
Unsupervised[Mam05].Using[YLXJ04]. Validation[GHL05].Variable[SS06a].
via[CZF+05].
W ABI[KJ04].Welcome[Wil04b].
Wild[PCGS05].
连续供墨Zero[YNBM05]. Zero-Suppressed[YNBM05]. References
Abul:2006:PAE [AAP06]Osman Abul,Reda Alhajj,and
Faruk Polat.A powerful ap-
proach for effectivefinding of sig-
nificantly differentially expressed
genes.IEEE/ACM Transac-
REFERENCES5
tions on Computational Biol-
ogy and Bioinformatics,3(3):
220–231,July2006.CODEN
ITCBCY.ISSN1545-5963.
Au:2005:ACG [ACWW05]Wai-Ho Au,Keith C.C.Chan,
Andrew K.C.Wong,and Yang
Wang.Attribute clustering for
grouping,selection,and clas-
sification of gene expression
data.IEEE/ACM Transac-
tions on Computational Biology
and Bioinformatics,2(2):83–101,
April2005.CODEN ITCBCY.
ISSN1545-5963.
Anonymous:2004:AI [Ano04a]Anonymous.Annual index.
IEEE/ACM Transactions on
Computational Biology and Bioin-
formatics,1(4):191–192,October
2004.CODEN ITCBCY.ISSN
1545-5963.伏秒特性的绘制方法和含义
Anonymous:2004:INA [Ano04b]Anonymous.Introduction of new
Associate Editor.IEEE/ACM
Transactions on Computational
Biology and Bioinformatics,1
(2):65,April2004.CODEN
ITCBCY.ISSN1545-5963.
Anonymous:2005:AI [Ano05a]Anonymous.2005annual in-
dex.IEEE/ACM Transac-
tions on Computational Biology
and Bioinformatics,2(4):380–
384,October2005.CODEN
ITCBCY.ISSN1545-5963.
Anonymous:2005:CPS [Ano05b]Anonymous.Call for papers for
Special Issue on Computational
Intelligence Approaches in Com-
putational Biology and Bioin-
formatics.IEEE/ACM Trans-
actions on Computational Biol-
ogy and Bioinformatics,2(3):271,
July2005.CODEN ITCBCY.
ISSN1545-5963.
Anonymous:2006:RL [Ano06a]Anonymous.2005reviewers
list.IEEE/ACM Transactions
on Computational Biology and
Bioinformatics,3(1):95–96,Jan-
uary2006.CODEN ITCBCY.
ISSN1545-5963.
inprint:2006:AI [Ano06b]Anonymous.Annual index.
IEEE/ACM Transactions on
Computational Biology and Bioin-
formatics,3(4):??,October2006.
CODEN ITCBCY.ISSN1545-
5963.
Allali:2005:NDH [AS05]Julien Allali and Marie-France
Sagot.A new distance for high
level RNA secondary structure
comparison.IEEE/ACM Trans-
actions on Computational Biol-
ogy and Bioinformatics,2(1):3–
14,January2005.CODEN
ITCBCY.ISSN1545-5963.
Bilu:2006:F AO [BAK06]Yonatan Bilu,Pankaj K.Agar-
wal,and Rachel Kolodny.
Faster algorithms for opti-
mal multiple sequence align-
ment based on pairwise com-
parisons.IEEE/ACM Trans-
actions on Computational Bi-
ology and Bioinformatics,3(4):
REFERENCES6
408–422,October2006.CODEN
ITCBCY.ISSN1545-5963.
Bafna:2004:NRE [BB04]Vineet Bafna and Vikas Bansal.
The number of recombina-
tion events in a sample his-
tory:Conflict graph and lower
bounds.IEEE/ACM Transac-
tions on Computational Biology
and Bioinformatics,1(2):78–90,
April2004.CODEN ITCBCY.
ISSN1545-5963.
Bertrand:2005:TRL [BG05]Denis Bertrand and Olivier
Gascuel.Topological rear-
rangements and local search
method for tandem duplication
trees.IEEE/ACM Transactions
on Computational Biology and
Bioinformatics,2(1):15–28,Jan-
uary2005.CODEN ITCBCY.
ISSN1545-5963.
Brown:2006:IPA [BH06]Daniel G.Brown and Ian M.Har-
密码文具盒rower.Integer programming ap-
proaches to haplotype inference
by pure parsimony.IEEE/ACM
Transactions on Computational
Biology and Bioinformatics,3(2):
141–154,April2006.CODEN
ITCBCY.ISSN1545-5963.
Berger:2006:JAG [BHMA06]John    A.Berger,Sampsa Hau-
taniemi,Sanjit K.Mitra,and
Jaakko Astola.Jointly analyzing
gene expression and copy number
data in breast cancer using data
reduction models.IEEE/ACM
Transactions on Computational
Biology and Bioinformatics,3(1):
2–16,January2006.CODEN
ITCBCY.ISSN1545-5963.
Bannai:2004:ADO [BHS+04]Hideo Bannai,Heikki Hyyro,
Ayumi Shinohara,Masayuki
Takeda,Kenta Nakai,and Satoru
Miyano.An O(N2)algorithm for
discovering optimal Boolean pat-
tern pairs.IEEE/ACM Trans-
actions on Computational Bi-
ology and Bioinformatics,1(4):
159–170,October2004.CODEN
ITCBCY.ISSN1545-5963.
Bernt:2006:GRB [BMM06]Matthias Bernt,Daniel Merkle,
and Martin Middendorf.Genome
rearrangement based on rever-
sals that preserve conserved in-
tervals.IEEE/ACM Transac-
tions on Computational Biol-
ogy and Bioinformatics,3(3):
275–288,July2006.CODEN
ITCBCY.ISSN1545-5963.
Berry:2006:IPC [BN06]Vincent Berry and Fran¸c ois
Nicolas.Improved parameter-
ized complexity of the max-
新型燃气炉
imum agreement subtree and
maximum compatible tree prob-
lems.IEEE/ACM Transac-
tions on Computational Biol-
ogy and Bioinformatics,3(3):
289–302,July2006.CODEN
ITCBCY.ISSN1545-5963.
Brown:2005:OMS [Bro05]Daniel G.Brown.Optimizing
multiple seeds for protein homol-
木盒制作
ogy search.IEEE/ACM Trans-
actions on Computational Biol-
ogy and Bioinformatics,2(1):29–

本文发布于:2024-09-20 23:40:55,感谢您对本站的认可!

本文链接:https://www.17tex.com/tex/4/256760.html

版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

标签:绘制   方法   文具盒   木盒
留言与评论(共有 0 条评论)
   
验证码:
Copyright ©2019-2024 Comsenz Inc.Powered by © 易纺专利技术学习网 豫ICP备2022007602号 豫公网安备41160202000603 站长QQ:729038198 关于我们 投诉建议